/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 00:14:47,330 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 00:14:47,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 00:14:47,382 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 00:14:47,383 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 00:14:47,393 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 00:14:47,395 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 00:14:47,398 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 00:14:47,399 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 00:14:47,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 00:14:47,404 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 00:14:47,405 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 00:14:47,405 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 00:14:47,407 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 00:14:47,408 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 00:14:47,409 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 00:14:47,410 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 00:14:47,410 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 00:14:47,414 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 00:14:47,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 00:14:47,420 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 00:14:47,421 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 00:14:47,422 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 00:14:47,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 00:14:47,428 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 00:14:47,428 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 00:14:47,428 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 00:14:47,429 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 00:14:47,429 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 00:14:47,430 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 00:14:47,430 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 00:14:47,430 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 00:14:47,431 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 00:14:47,432 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 00:14:47,433 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 00:14:47,433 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 00:14:47,433 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 00:14:47,433 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 00:14:47,433 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 00:14:47,434 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 00:14:47,434 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 00:14:47,435 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-01-19 00:14:47,456 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 00:14:47,457 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 00:14:47,457 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 00:14:47,457 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 00:14:47,458 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 00:14:47,458 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 00:14:47,458 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 00:14:47,458 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 00:14:47,458 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 00:14:47,458 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 00:14:47,459 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 00:14:47,459 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 00:14:47,459 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 00:14:47,459 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 00:14:47,459 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 00:14:47,459 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 00:14:47,459 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 00:14:47,459 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 00:14:47,459 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 00:14:47,460 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 00:14:47,460 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 00:14:47,460 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 00:14:47,460 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 00:14:47,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 00:14:47,460 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 00:14:47,460 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 00:14:47,460 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 00:14:47,461 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 00:14:47,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 00:14:47,461 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 00:14:47,461 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 00:14:47,461 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-19 00:14:47,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 00:14:47,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 00:14:47,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 00:14:47,646 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 00:14:47,647 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 00:14:47,647 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2022-01-19 00:14:47,695 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/360c557bf/b1a58bdba6454ae2899d6bae771b4cf0/FLAGa8c6c50d1 [2022-01-19 00:14:48,015 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 00:14:48,015 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2022-01-19 00:14:48,023 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/360c557bf/b1a58bdba6454ae2899d6bae771b4cf0/FLAGa8c6c50d1 [2022-01-19 00:14:48,448 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/360c557bf/b1a58bdba6454ae2899d6bae771b4cf0 [2022-01-19 00:14:48,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 00:14:48,451 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 00:14:48,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 00:14:48,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 00:14:48,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 00:14:48,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 12:14:48" (1/1) ... [2022-01-19 00:14:48,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@254e9e0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:14:48, skipping insertion in model container [2022-01-19 00:14:48,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 12:14:48" (1/1) ... [2022-01-19 00:14:48,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 00:14:48,471 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 00:14:48,596 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c[2237,2250] [2022-01-19 00:14:48,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 00:14:48,603 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 00:14:48,614 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c[2237,2250] [2022-01-19 00:14:48,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 00:14:48,622 INFO L208 MainTranslator]: Completed translation [2022-01-19 00:14:48,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:14:48 WrapperNode [2022-01-19 00:14:48,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 00:14:48,623 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 00:14:48,624 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 00:14:48,624 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 00:14:48,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:14:48" (1/1) ... [2022-01-19 00:14:48,640 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:14:48" (1/1) ... [2022-01-19 00:14:48,657 INFO L137 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2022-01-19 00:14:48,658 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 00:14:48,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 00:14:48,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 00:14:48,659 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 00:14:48,663 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:14:48" (1/1) ... [2022-01-19 00:14:48,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:14:48" (1/1) ... [2022-01-19 00:14:48,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:14:48" (1/1) ... [2022-01-19 00:14:48,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:14:48" (1/1) ... [2022-01-19 00:14:48,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:14:48" (1/1) ... [2022-01-19 00:14:48,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:14:48" (1/1) ... [2022-01-19 00:14:48,674 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:14:48" (1/1) ... [2022-01-19 00:14:48,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 00:14:48,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 00:14:48,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 00:14:48,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 00:14:48,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:14:48" (1/1) ... [2022-01-19 00:14:48,687 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 00:14:48,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 00:14:48,704 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 00:14:48,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 00:14:48,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 00:14:48,734 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 00:14:48,735 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 00:14:48,735 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 00:14:48,735 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 00:14:48,735 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 00:14:48,735 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 00:14:48,735 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-01-19 00:14:48,735 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-01-19 00:14:48,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 00:14:48,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 00:14:48,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 00:14:48,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 00:14:48,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 00:14:48,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 00:14:48,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 00:14:48,736 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 00:14:48,803 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 00:14:48,804 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 00:14:48,954 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 00:14:48,961 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 00:14:48,961 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-19 00:14:48,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 12:14:48 BoogieIcfgContainer [2022-01-19 00:14:48,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 00:14:48,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 00:14:48,963 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 00:14:48,965 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 00:14:48,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 12:14:48" (1/3) ... [2022-01-19 00:14:48,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cb0c713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 12:14:48, skipping insertion in model container [2022-01-19 00:14:48,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:14:48" (2/3) ... [2022-01-19 00:14:48,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cb0c713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 12:14:48, skipping insertion in model container [2022-01-19 00:14:48,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 12:14:48" (3/3) ... [2022-01-19 00:14:48,967 INFO L111 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2022-01-19 00:14:48,970 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 00:14:48,970 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 00:14:48,970 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 00:14:49,000 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:49,000 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:49,000 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:49,000 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:49,001 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:49,001 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:49,001 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:49,001 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:49,002 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:49,002 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:49,003 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:49,003 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:49,004 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:49,004 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:49,004 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:49,004 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:49,006 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:49,006 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:49,008 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:49,008 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:49,008 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:49,009 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:49,009 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:49,009 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:49,013 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-01-19 00:14:49,053 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 00:14:49,060 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 00:14:49,060 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-19 00:14:49,067 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 125 transitions, 282 flow [2022-01-19 00:14:49,123 INFO L129 PetriNetUnfolder]: 10/121 cut-off events. [2022-01-19 00:14:49,126 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-19 00:14:49,128 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 121 events. 10/121 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2022-01-19 00:14:49,129 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 125 transitions, 282 flow [2022-01-19 00:14:49,133 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 108 transitions, 240 flow [2022-01-19 00:14:49,164 INFO L129 PetriNetUnfolder]: 10/107 cut-off events. [2022-01-19 00:14:49,164 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-19 00:14:49,164 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:14:49,165 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:14:49,165 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 00:14:49,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:14:49,174 INFO L85 PathProgramCache]: Analyzing trace with hash -121838707, now seen corresponding path program 1 times [2022-01-19 00:14:49,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:14:49,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625808328] [2022-01-19 00:14:49,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:14:49,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:14:49,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:14:49,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:14:49,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:14:49,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625808328] [2022-01-19 00:14:49,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625808328] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:14:49,334 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:14:49,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 00:14:49,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105776631] [2022-01-19 00:14:49,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:14:49,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 00:14:49,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:14:49,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 00:14:49,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 00:14:49,366 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 125 [2022-01-19 00:14:49,370 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 108 transitions, 240 flow. Second operand has 2 states, 2 states have (on average 115.0) internal successors, (230), 2 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:49,370 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:14:49,371 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 125 [2022-01-19 00:14:49,372 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:14:49,421 INFO L129 PetriNetUnfolder]: 4/102 cut-off events. [2022-01-19 00:14:49,421 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-01-19 00:14:49,422 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 102 events. 4/102 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 18/114 useless extension candidates. Maximal degree in co-relation 83. Up to 9 conditions per place. [2022-01-19 00:14:49,423 INFO L132 encePairwiseOnDemand]: 119/125 looper letters, 8 selfloop transitions, 0 changer transitions 2/102 dead transitions. [2022-01-19 00:14:49,423 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 102 transitions, 244 flow [2022-01-19 00:14:49,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 00:14:49,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 00:14:49,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 234 transitions. [2022-01-19 00:14:49,431 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.936 [2022-01-19 00:14:49,432 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 234 transitions. [2022-01-19 00:14:49,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 234 transitions. [2022-01-19 00:14:49,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:14:49,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 234 transitions. [2022-01-19 00:14:49,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 117.0) internal successors, (234), 2 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:49,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:49,439 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:49,440 INFO L186 Difference]: Start difference. First operand has 111 places, 108 transitions, 240 flow. Second operand 2 states and 234 transitions. [2022-01-19 00:14:49,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 102 transitions, 244 flow [2022-01-19 00:14:49,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 102 transitions, 228 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-01-19 00:14:49,444 INFO L242 Difference]: Finished difference. Result has 104 places, 100 transitions, 208 flow [2022-01-19 00:14:49,446 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=208, PETRI_PLACES=104, PETRI_TRANSITIONS=100} [2022-01-19 00:14:49,448 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, -7 predicate places. [2022-01-19 00:14:49,448 INFO L470 AbstractCegarLoop]: Abstraction has has 104 places, 100 transitions, 208 flow [2022-01-19 00:14:49,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 115.0) internal successors, (230), 2 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:49,448 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:14:49,448 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:14:49,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 00:14:49,449 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 00:14:49,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:14:49,449 INFO L85 PathProgramCache]: Analyzing trace with hash 560355165, now seen corresponding path program 1 times [2022-01-19 00:14:49,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:14:49,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115639712] [2022-01-19 00:14:49,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:14:49,450 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:14:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:14:49,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:14:49,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:14:49,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115639712] [2022-01-19 00:14:49,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115639712] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:14:49,764 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:14:49,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 00:14:49,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606058230] [2022-01-19 00:14:49,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:14:49,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 00:14:49,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:14:49,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 00:14:49,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-19 00:14:49,769 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 125 [2022-01-19 00:14:49,769 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 100 transitions, 208 flow. Second operand has 7 states, 7 states have (on average 84.0) internal successors, (588), 7 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:49,769 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:14:49,769 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 125 [2022-01-19 00:14:49,769 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:14:50,079 INFO L129 PetriNetUnfolder]: 895/1602 cut-off events. [2022-01-19 00:14:50,080 INFO L130 PetriNetUnfolder]: For 80/135 co-relation queries the response was YES. [2022-01-19 00:14:50,084 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2918 conditions, 1602 events. 895/1602 cut-off events. For 80/135 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7810 event pairs, 272 based on Foata normal form. 2/1156 useless extension candidates. Maximal degree in co-relation 2915. Up to 796 conditions per place. [2022-01-19 00:14:50,094 INFO L132 encePairwiseOnDemand]: 115/125 looper letters, 47 selfloop transitions, 7 changer transitions 4/122 dead transitions. [2022-01-19 00:14:50,094 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 122 transitions, 375 flow [2022-01-19 00:14:50,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 00:14:50,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 00:14:50,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 619 transitions. [2022-01-19 00:14:50,099 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7074285714285714 [2022-01-19 00:14:50,100 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 619 transitions. [2022-01-19 00:14:50,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 619 transitions. [2022-01-19 00:14:50,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:14:50,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 619 transitions. [2022-01-19 00:14:50,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 88.42857142857143) internal successors, (619), 7 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:50,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:50,106 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:50,106 INFO L186 Difference]: Start difference. First operand has 104 places, 100 transitions, 208 flow. Second operand 7 states and 619 transitions. [2022-01-19 00:14:50,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 122 transitions, 375 flow [2022-01-19 00:14:50,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 122 transitions, 375 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 00:14:50,109 INFO L242 Difference]: Finished difference. Result has 111 places, 104 transitions, 249 flow [2022-01-19 00:14:50,109 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=249, PETRI_PLACES=111, PETRI_TRANSITIONS=104} [2022-01-19 00:14:50,110 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 0 predicate places. [2022-01-19 00:14:50,110 INFO L470 AbstractCegarLoop]: Abstraction has has 111 places, 104 transitions, 249 flow [2022-01-19 00:14:50,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.0) internal successors, (588), 7 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:50,111 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:14:50,111 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:14:50,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 00:14:50,112 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 00:14:50,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:14:50,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1307809793, now seen corresponding path program 1 times [2022-01-19 00:14:50,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:14:50,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272506677] [2022-01-19 00:14:50,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:14:50,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:14:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:14:50,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:14:50,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:14:50,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272506677] [2022-01-19 00:14:50,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272506677] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:14:50,271 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:14:50,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 00:14:50,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934250746] [2022-01-19 00:14:50,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:14:50,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 00:14:50,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:14:50,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 00:14:50,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-19 00:14:50,274 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 125 [2022-01-19 00:14:50,274 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 104 transitions, 249 flow. Second operand has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:50,274 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:14:50,274 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 125 [2022-01-19 00:14:50,274 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:14:50,617 INFO L129 PetriNetUnfolder]: 1373/2607 cut-off events. [2022-01-19 00:14:50,617 INFO L130 PetriNetUnfolder]: For 392/412 co-relation queries the response was YES. [2022-01-19 00:14:50,626 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5134 conditions, 2607 events. 1373/2607 cut-off events. For 392/412 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 15742 event pairs, 505 based on Foata normal form. 0/1875 useless extension candidates. Maximal degree in co-relation 5127. Up to 542 conditions per place. [2022-01-19 00:14:50,642 INFO L132 encePairwiseOnDemand]: 114/125 looper letters, 70 selfloop transitions, 14 changer transitions 0/154 dead transitions. [2022-01-19 00:14:50,642 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 154 transitions, 552 flow [2022-01-19 00:14:50,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 00:14:50,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 00:14:50,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 672 transitions. [2022-01-19 00:14:50,644 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.768 [2022-01-19 00:14:50,645 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 672 transitions. [2022-01-19 00:14:50,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 672 transitions. [2022-01-19 00:14:50,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:14:50,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 672 transitions. [2022-01-19 00:14:50,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.0) internal successors, (672), 7 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:50,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:50,648 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:50,648 INFO L186 Difference]: Start difference. First operand has 111 places, 104 transitions, 249 flow. Second operand 7 states and 672 transitions. [2022-01-19 00:14:50,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 154 transitions, 552 flow [2022-01-19 00:14:50,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 154 transitions, 531 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-01-19 00:14:50,655 INFO L242 Difference]: Finished difference. Result has 114 places, 110 transitions, 318 flow [2022-01-19 00:14:50,655 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=318, PETRI_PLACES=114, PETRI_TRANSITIONS=110} [2022-01-19 00:14:50,657 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 3 predicate places. [2022-01-19 00:14:50,658 INFO L470 AbstractCegarLoop]: Abstraction has has 114 places, 110 transitions, 318 flow [2022-01-19 00:14:50,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:50,658 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:14:50,658 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:14:50,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 00:14:50,659 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 00:14:50,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:14:50,661 INFO L85 PathProgramCache]: Analyzing trace with hash 2113143597, now seen corresponding path program 2 times [2022-01-19 00:14:50,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:14:50,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917048542] [2022-01-19 00:14:50,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:14:50,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:14:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:14:50,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:14:50,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:14:50,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917048542] [2022-01-19 00:14:50,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917048542] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:14:50,905 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:14:50,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 00:14:50,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509331533] [2022-01-19 00:14:50,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:14:50,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 00:14:50,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:14:50,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 00:14:50,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 00:14:50,913 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 125 [2022-01-19 00:14:50,913 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 110 transitions, 318 flow. Second operand has 6 states, 6 states have (on average 83.33333333333333) internal successors, (500), 6 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:50,914 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:14:50,914 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 125 [2022-01-19 00:14:50,914 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:14:51,228 INFO L129 PetriNetUnfolder]: 1489/2668 cut-off events. [2022-01-19 00:14:51,228 INFO L130 PetriNetUnfolder]: For 2290/2290 co-relation queries the response was YES. [2022-01-19 00:14:51,234 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6864 conditions, 2668 events. 1489/2668 cut-off events. For 2290/2290 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 14987 event pairs, 322 based on Foata normal form. 35/2191 useless extension candidates. Maximal degree in co-relation 6856. Up to 1708 conditions per place. [2022-01-19 00:14:51,246 INFO L132 encePairwiseOnDemand]: 114/125 looper letters, 64 selfloop transitions, 12 changer transitions 1/139 dead transitions. [2022-01-19 00:14:51,246 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 139 transitions, 576 flow [2022-01-19 00:14:51,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 00:14:51,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 00:14:51,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 539 transitions. [2022-01-19 00:14:51,247 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7186666666666667 [2022-01-19 00:14:51,247 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 539 transitions. [2022-01-19 00:14:51,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 539 transitions. [2022-01-19 00:14:51,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:14:51,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 539 transitions. [2022-01-19 00:14:51,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 89.83333333333333) internal successors, (539), 6 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:51,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:51,250 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:51,250 INFO L186 Difference]: Start difference. First operand has 114 places, 110 transitions, 318 flow. Second operand 6 states and 539 transitions. [2022-01-19 00:14:51,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 139 transitions, 576 flow [2022-01-19 00:14:51,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 139 transitions, 572 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 00:14:51,255 INFO L242 Difference]: Finished difference. Result has 119 places, 115 transitions, 384 flow [2022-01-19 00:14:51,255 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=384, PETRI_PLACES=119, PETRI_TRANSITIONS=115} [2022-01-19 00:14:51,256 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 8 predicate places. [2022-01-19 00:14:51,256 INFO L470 AbstractCegarLoop]: Abstraction has has 119 places, 115 transitions, 384 flow [2022-01-19 00:14:51,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.33333333333333) internal successors, (500), 6 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:51,256 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:14:51,256 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:14:51,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 00:14:51,256 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 00:14:51,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:14:51,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1971798559, now seen corresponding path program 1 times [2022-01-19 00:14:51,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:14:51,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108366660] [2022-01-19 00:14:51,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:14:51,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:14:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:14:51,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:14:51,432 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:14:51,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108366660] [2022-01-19 00:14:51,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108366660] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:14:51,433 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:14:51,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 00:14:51,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312481782] [2022-01-19 00:14:51,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:14:51,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 00:14:51,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:14:51,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 00:14:51,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 00:14:51,435 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 125 [2022-01-19 00:14:51,435 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 115 transitions, 384 flow. Second operand has 6 states, 6 states have (on average 83.33333333333333) internal successors, (500), 6 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:51,435 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:14:51,435 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 125 [2022-01-19 00:14:51,435 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:14:51,774 INFO L129 PetriNetUnfolder]: 1464/2715 cut-off events. [2022-01-19 00:14:51,774 INFO L130 PetriNetUnfolder]: For 3938/4007 co-relation queries the response was YES. [2022-01-19 00:14:51,779 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7544 conditions, 2715 events. 1464/2715 cut-off events. For 3938/4007 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 15956 event pairs, 475 based on Foata normal form. 1/2224 useless extension candidates. Maximal degree in co-relation 7533. Up to 1708 conditions per place. [2022-01-19 00:14:51,793 INFO L132 encePairwiseOnDemand]: 114/125 looper letters, 70 selfloop transitions, 19 changer transitions 1/152 dead transitions. [2022-01-19 00:14:51,793 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 152 transitions, 765 flow [2022-01-19 00:14:51,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 00:14:51,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 00:14:51,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 540 transitions. [2022-01-19 00:14:51,795 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.72 [2022-01-19 00:14:51,795 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 540 transitions. [2022-01-19 00:14:51,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 540 transitions. [2022-01-19 00:14:51,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:14:51,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 540 transitions. [2022-01-19 00:14:51,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.0) internal successors, (540), 6 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:51,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:51,798 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:51,798 INFO L186 Difference]: Start difference. First operand has 119 places, 115 transitions, 384 flow. Second operand 6 states and 540 transitions. [2022-01-19 00:14:51,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 152 transitions, 765 flow [2022-01-19 00:14:51,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 152 transitions, 723 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-01-19 00:14:51,805 INFO L242 Difference]: Finished difference. Result has 122 places, 124 transitions, 476 flow [2022-01-19 00:14:51,805 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=476, PETRI_PLACES=122, PETRI_TRANSITIONS=124} [2022-01-19 00:14:51,806 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 11 predicate places. [2022-01-19 00:14:51,806 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 124 transitions, 476 flow [2022-01-19 00:14:51,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.33333333333333) internal successors, (500), 6 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:51,807 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:14:51,807 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:14:51,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 00:14:51,807 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 00:14:51,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:14:51,807 INFO L85 PathProgramCache]: Analyzing trace with hash 760466257, now seen corresponding path program 1 times [2022-01-19 00:14:51,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:14:51,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462499962] [2022-01-19 00:14:51,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:14:51,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:14:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:14:51,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:14:51,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:14:51,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462499962] [2022-01-19 00:14:51,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462499962] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:14:51,966 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:14:51,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 00:14:51,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525629534] [2022-01-19 00:14:51,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:14:51,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 00:14:51,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:14:51,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 00:14:51,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 00:14:51,968 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 125 [2022-01-19 00:14:51,968 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 124 transitions, 476 flow. Second operand has 6 states, 6 states have (on average 83.33333333333333) internal successors, (500), 6 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:51,968 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:14:51,968 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 125 [2022-01-19 00:14:51,968 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:14:52,236 INFO L129 PetriNetUnfolder]: 1403/2671 cut-off events. [2022-01-19 00:14:52,236 INFO L130 PetriNetUnfolder]: For 3760/3827 co-relation queries the response was YES. [2022-01-19 00:14:52,243 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7957 conditions, 2671 events. 1403/2671 cut-off events. For 3760/3827 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 16153 event pairs, 417 based on Foata normal form. 13/2526 useless extension candidates. Maximal degree in co-relation 7944. Up to 1673 conditions per place. [2022-01-19 00:14:52,253 INFO L132 encePairwiseOnDemand]: 115/125 looper letters, 68 selfloop transitions, 21 changer transitions 1/152 dead transitions. [2022-01-19 00:14:52,253 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 152 transitions, 778 flow [2022-01-19 00:14:52,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 00:14:52,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 00:14:52,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 537 transitions. [2022-01-19 00:14:52,255 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.716 [2022-01-19 00:14:52,255 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 537 transitions. [2022-01-19 00:14:52,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 537 transitions. [2022-01-19 00:14:52,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:14:52,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 537 transitions. [2022-01-19 00:14:52,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:52,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:52,258 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:52,258 INFO L186 Difference]: Start difference. First operand has 122 places, 124 transitions, 476 flow. Second operand 6 states and 537 transitions. [2022-01-19 00:14:52,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 152 transitions, 778 flow [2022-01-19 00:14:52,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 152 transitions, 757 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 00:14:52,264 INFO L242 Difference]: Finished difference. Result has 126 places, 128 transitions, 548 flow [2022-01-19 00:14:52,264 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=548, PETRI_PLACES=126, PETRI_TRANSITIONS=128} [2022-01-19 00:14:52,266 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 15 predicate places. [2022-01-19 00:14:52,266 INFO L470 AbstractCegarLoop]: Abstraction has has 126 places, 128 transitions, 548 flow [2022-01-19 00:14:52,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.33333333333333) internal successors, (500), 6 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:52,268 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:14:52,269 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:14:52,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 00:14:52,270 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 00:14:52,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:14:52,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1466145333, now seen corresponding path program 1 times [2022-01-19 00:14:52,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:14:52,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610203104] [2022-01-19 00:14:52,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:14:52,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:14:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:14:52,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:14:52,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:14:52,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610203104] [2022-01-19 00:14:52,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610203104] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 00:14:52,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002258294] [2022-01-19 00:14:52,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:14:52,469 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:14:52,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 00:14:52,472 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 00:14:52,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-19 00:14:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:14:52,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-19 00:14:52,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 00:14:52,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:14:52,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 00:14:53,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:14:53,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002258294] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 00:14:53,244 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 00:14:53,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-01-19 00:14:53,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502393236] [2022-01-19 00:14:53,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 00:14:53,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-19 00:14:53,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:14:53,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-19 00:14:53,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-01-19 00:14:53,247 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 125 [2022-01-19 00:14:53,248 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 128 transitions, 548 flow. Second operand has 14 states, 14 states have (on average 82.5) internal successors, (1155), 14 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:53,248 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:14:53,248 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 125 [2022-01-19 00:14:53,248 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:14:54,059 INFO L129 PetriNetUnfolder]: 2685/4833 cut-off events. [2022-01-19 00:14:54,059 INFO L130 PetriNetUnfolder]: For 7692/7803 co-relation queries the response was YES. [2022-01-19 00:14:54,068 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14636 conditions, 4833 events. 2685/4833 cut-off events. For 7692/7803 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 31694 event pairs, 362 based on Foata normal form. 170/4828 useless extension candidates. Maximal degree in co-relation 14621. Up to 1149 conditions per place. [2022-01-19 00:14:54,087 INFO L132 encePairwiseOnDemand]: 110/125 looper letters, 171 selfloop transitions, 32 changer transitions 2/267 dead transitions. [2022-01-19 00:14:54,088 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 267 transitions, 1690 flow [2022-01-19 00:14:54,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 00:14:54,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 00:14:54,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1251 transitions. [2022-01-19 00:14:54,090 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7148571428571429 [2022-01-19 00:14:54,090 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1251 transitions. [2022-01-19 00:14:54,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1251 transitions. [2022-01-19 00:14:54,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:14:54,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1251 transitions. [2022-01-19 00:14:54,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 89.35714285714286) internal successors, (1251), 14 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:54,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 125.0) internal successors, (1875), 15 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:54,095 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 125.0) internal successors, (1875), 15 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:54,095 INFO L186 Difference]: Start difference. First operand has 126 places, 128 transitions, 548 flow. Second operand 14 states and 1251 transitions. [2022-01-19 00:14:54,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 267 transitions, 1690 flow [2022-01-19 00:14:54,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 267 transitions, 1653 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-01-19 00:14:54,103 INFO L242 Difference]: Finished difference. Result has 145 places, 138 transitions, 699 flow [2022-01-19 00:14:54,103 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=699, PETRI_PLACES=145, PETRI_TRANSITIONS=138} [2022-01-19 00:14:54,104 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 34 predicate places. [2022-01-19 00:14:54,104 INFO L470 AbstractCegarLoop]: Abstraction has has 145 places, 138 transitions, 699 flow [2022-01-19 00:14:54,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 82.5) internal successors, (1155), 14 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:54,104 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:14:54,104 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:14:54,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 00:14:54,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:14:54,316 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 00:14:54,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:14:54,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1425051441, now seen corresponding path program 2 times [2022-01-19 00:14:54,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:14:54,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71868137] [2022-01-19 00:14:54,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:14:54,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:14:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:14:54,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:14:54,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:14:54,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71868137] [2022-01-19 00:14:54,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71868137] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:14:54,401 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:14:54,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 00:14:54,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655225796] [2022-01-19 00:14:54,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:14:54,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 00:14:54,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:14:54,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 00:14:54,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-19 00:14:54,402 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 125 [2022-01-19 00:14:54,402 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 138 transitions, 699 flow. Second operand has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:54,402 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:14:54,403 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 125 [2022-01-19 00:14:54,403 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:14:54,900 INFO L129 PetriNetUnfolder]: 2785/5234 cut-off events. [2022-01-19 00:14:54,900 INFO L130 PetriNetUnfolder]: For 13554/13634 co-relation queries the response was YES. [2022-01-19 00:14:54,921 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19198 conditions, 5234 events. 2785/5234 cut-off events. For 13554/13634 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 36975 event pairs, 388 based on Foata normal form. 141/5158 useless extension candidates. Maximal degree in co-relation 19175. Up to 1693 conditions per place. [2022-01-19 00:14:54,951 INFO L132 encePairwiseOnDemand]: 114/125 looper letters, 98 selfloop transitions, 21 changer transitions 0/195 dead transitions. [2022-01-19 00:14:54,951 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 195 transitions, 1275 flow [2022-01-19 00:14:54,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 00:14:54,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 00:14:54,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 668 transitions. [2022-01-19 00:14:54,953 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7634285714285715 [2022-01-19 00:14:54,953 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 668 transitions. [2022-01-19 00:14:54,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 668 transitions. [2022-01-19 00:14:54,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:14:54,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 668 transitions. [2022-01-19 00:14:54,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.42857142857143) internal successors, (668), 7 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:54,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:54,956 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:54,956 INFO L186 Difference]: Start difference. First operand has 145 places, 138 transitions, 699 flow. Second operand 7 states and 668 transitions. [2022-01-19 00:14:54,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 195 transitions, 1275 flow [2022-01-19 00:14:54,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 195 transitions, 1261 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-01-19 00:14:54,984 INFO L242 Difference]: Finished difference. Result has 151 places, 141 transitions, 792 flow [2022-01-19 00:14:54,985 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=792, PETRI_PLACES=151, PETRI_TRANSITIONS=141} [2022-01-19 00:14:54,986 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 40 predicate places. [2022-01-19 00:14:54,986 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 141 transitions, 792 flow [2022-01-19 00:14:54,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:54,987 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:14:54,987 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:14:54,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 00:14:54,987 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 00:14:54,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:14:54,987 INFO L85 PathProgramCache]: Analyzing trace with hash -655880267, now seen corresponding path program 2 times [2022-01-19 00:14:54,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:14:54,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113946095] [2022-01-19 00:14:54,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:14:54,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:14:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:14:55,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:14:55,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:14:55,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113946095] [2022-01-19 00:14:55,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113946095] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 00:14:55,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325626986] [2022-01-19 00:14:55,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 00:14:55,137 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:14:55,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 00:14:55,138 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 00:14:55,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-19 00:14:55,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 00:14:55,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 00:14:55,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-19 00:14:55,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 00:14:55,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:14:55,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 00:14:55,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:14:55,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325626986] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 00:14:55,678 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 00:14:55,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-01-19 00:14:55,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865283371] [2022-01-19 00:14:55,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 00:14:55,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-19 00:14:55,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:14:55,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-19 00:14:55,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-01-19 00:14:55,680 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 125 [2022-01-19 00:14:55,680 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 141 transitions, 792 flow. Second operand has 14 states, 14 states have (on average 81.85714285714286) internal successors, (1146), 14 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:55,680 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:14:55,681 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 125 [2022-01-19 00:14:55,681 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:14:56,707 INFO L129 PetriNetUnfolder]: 4341/7678 cut-off events. [2022-01-19 00:14:56,707 INFO L130 PetriNetUnfolder]: For 29767/29842 co-relation queries the response was YES. [2022-01-19 00:14:56,738 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31790 conditions, 7678 events. 4341/7678 cut-off events. For 29767/29842 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 54910 event pairs, 1161 based on Foata normal form. 150/7599 useless extension candidates. Maximal degree in co-relation 31764. Up to 2702 conditions per place. [2022-01-19 00:14:56,775 INFO L132 encePairwiseOnDemand]: 110/125 looper letters, 223 selfloop transitions, 32 changer transitions 2/319 dead transitions. [2022-01-19 00:14:56,775 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 319 transitions, 2721 flow [2022-01-19 00:14:56,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 00:14:56,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 00:14:56,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1247 transitions. [2022-01-19 00:14:56,777 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7125714285714285 [2022-01-19 00:14:56,777 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1247 transitions. [2022-01-19 00:14:56,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1247 transitions. [2022-01-19 00:14:56,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:14:56,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1247 transitions. [2022-01-19 00:14:56,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 89.07142857142857) internal successors, (1247), 14 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:56,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 125.0) internal successors, (1875), 15 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:56,782 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 125.0) internal successors, (1875), 15 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:56,782 INFO L186 Difference]: Start difference. First operand has 151 places, 141 transitions, 792 flow. Second operand 14 states and 1247 transitions. [2022-01-19 00:14:56,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 319 transitions, 2721 flow [2022-01-19 00:14:56,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 319 transitions, 2644 flow, removed 28 selfloop flow, removed 3 redundant places. [2022-01-19 00:14:56,849 INFO L242 Difference]: Finished difference. Result has 168 places, 150 transitions, 950 flow [2022-01-19 00:14:56,849 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=950, PETRI_PLACES=168, PETRI_TRANSITIONS=150} [2022-01-19 00:14:56,850 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 57 predicate places. [2022-01-19 00:14:56,850 INFO L470 AbstractCegarLoop]: Abstraction has has 168 places, 150 transitions, 950 flow [2022-01-19 00:14:56,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 81.85714285714286) internal successors, (1146), 14 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:14:56,850 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:14:56,850 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:14:56,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-19 00:14:57,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-01-19 00:14:57,064 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 00:14:57,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:14:57,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1429212971, now seen corresponding path program 1 times [2022-01-19 00:14:57,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:14:57,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884658584] [2022-01-19 00:14:57,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:14:57,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:14:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:14:57,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:14:57,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:14:57,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884658584] [2022-01-19 00:14:57,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884658584] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 00:14:57,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536726497] [2022-01-19 00:14:57,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:14:57,417 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:14:57,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 00:14:57,419 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 00:14:57,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-19 00:14:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:14:57,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-19 00:14:57,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 00:15:22,285 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-01-19 00:15:23,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:15:23,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 00:15:41,419 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-01-19 00:15:42,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:15:42,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536726497] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 00:15:42,300 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 00:15:42,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2022-01-19 00:15:42,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996131134] [2022-01-19 00:15:42,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 00:15:42,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 00:15:42,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:15:42,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 00:15:42,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=544, Unknown=6, NotChecked=0, Total=702 [2022-01-19 00:15:42,303 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 125 [2022-01-19 00:15:42,304 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 150 transitions, 950 flow. Second operand has 27 states, 27 states have (on average 80.5925925925926) internal successors, (2176), 27 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:15:42,305 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:15:42,305 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 125 [2022-01-19 00:15:42,305 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:15:44,109 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:15:46,117 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:15:48,123 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:16:02,279 WARN L228 SmtUtils]: Spent 8.68s on a formula simplification. DAG size of input: 62 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 00:16:16,039 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:16:17,542 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:16:19,771 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:16:21,820 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:16:25,285 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:16:30,062 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:16:32,570 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:16:47,849 WARN L228 SmtUtils]: Spent 6.79s on a formula simplification. DAG size of input: 79 DAG size of output: 76 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 00:17:00,451 WARN L228 SmtUtils]: Spent 5.87s on a formula simplification. DAG size of input: 82 DAG size of output: 79 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 00:17:02,643 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:17:05,107 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:17:42,806 WARN L228 SmtUtils]: Spent 20.36s on a formula simplification. DAG size of input: 81 DAG size of output: 78 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 00:17:44,839 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:17:46,543 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:18:10,882 WARN L228 SmtUtils]: Spent 18.52s on a formula simplification. DAG size of input: 79 DAG size of output: 76 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 00:18:13,880 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:18:47,046 WARN L228 SmtUtils]: Spent 24.85s on a formula simplification. DAG size of input: 92 DAG size of output: 81 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 00:19:07,548 WARN L228 SmtUtils]: Spent 14.01s on a formula simplification. DAG size of input: 84 DAG size of output: 81 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 00:19:09,938 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:19:16,925 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:19:19,728 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:19:39,051 WARN L228 SmtUtils]: Spent 13.55s on a formula simplification. DAG size of input: 91 DAG size of output: 80 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 00:19:41,460 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:19:43,469 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:19:45,323 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:19:47,339 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:19:50,923 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:20:04,548 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:20:06,445 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:20:09,089 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:20:32,194 WARN L228 SmtUtils]: Spent 19.16s on a formula simplification. DAG size of input: 94 DAG size of output: 83 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 00:20:33,621 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:20:35,978 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:20:37,986 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:20:40,009 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:20:42,038 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:20:45,288 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:20:48,269 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:20:51,030 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:20:53,060 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:20:55,621 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:20:59,419 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:21:02,047 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:21:04,057 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:21:06,883 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:21:15,932 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:21:17,941 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:21:19,980 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:21:23,689 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:21:25,706 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:21:30,848 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:21:33,741 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:21:35,869 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:21:38,000 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:21:47,430 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:21:49,446 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:21:52,002 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:21:54,011 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:21:55,750 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:21:57,843 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:22:05,198 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:22:07,661 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:22:09,080 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:22:16,552 WARN L228 SmtUtils]: Spent 5.22s on a formula simplification. DAG size of input: 53 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 00:22:36,883 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:22:39,977 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:23:04,661 WARN L228 SmtUtils]: Spent 8.58s on a formula simplification. DAG size of input: 77 DAG size of output: 74 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 00:23:09,095 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:23:24,571 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:23:26,780 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:23:29,059 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:23:31,433 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:23:33,478 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:23:38,481 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:23:41,365 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:23:44,714 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:23:48,159 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:23:53,796 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:23:55,289 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:23:57,700 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:24:00,292 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:24:16,625 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:24:18,791 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:24:20,100 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:24:22,109 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:24:31,689 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:24:34,264 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:24:36,300 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:24:38,423 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:24:56,164 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:24:59,626 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:25:04,512 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:25:06,679 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:25:08,754 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:25:10,776 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:25:12,787 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:25:14,799 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:25:17,636 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:25:20,221 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:25:22,313 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:25:24,832 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:25:26,911 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:25:30,738 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:25:36,367 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:25:38,929 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:25:43,689 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:25:46,556 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:25:50,191 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:25:52,630 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:25:55,103 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:25:58,015 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:25:59,306 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:26:05,048 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:26:06,467 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:26:09,580 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:26:12,038 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:26:15,107 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:26:17,388 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:26:18,028 INFO L129 PetriNetUnfolder]: 13151/23591 cut-off events. [2022-01-19 00:26:18,028 INFO L130 PetriNetUnfolder]: For 113722/114075 co-relation queries the response was YES. [2022-01-19 00:26:18,124 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104101 conditions, 23591 events. 13151/23591 cut-off events. For 113722/114075 co-relation queries the response was YES. Maximal size of possible extension queue 1390. Compared 206618 event pairs, 906 based on Foata normal form. 101/23114 useless extension candidates. Maximal degree in co-relation 104068. Up to 8300 conditions per place. [2022-01-19 00:26:18,253 INFO L132 encePairwiseOnDemand]: 104/125 looper letters, 629 selfloop transitions, 331 changer transitions 20/1042 dead transitions. [2022-01-19 00:26:18,253 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 1042 transitions, 10193 flow [2022-01-19 00:26:18,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-01-19 00:26:18,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2022-01-19 00:26:18,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 5562 transitions. [2022-01-19 00:26:18,263 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7176774193548388 [2022-01-19 00:26:18,263 INFO L72 ComplementDD]: Start complementDD. Operand 62 states and 5562 transitions. [2022-01-19 00:26:18,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 5562 transitions. [2022-01-19 00:26:18,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:26:18,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 62 states and 5562 transitions. [2022-01-19 00:26:18,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 63 states, 62 states have (on average 89.70967741935483) internal successors, (5562), 62 states have internal predecessors, (5562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:26:18,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 63 states, 63 states have (on average 125.0) internal successors, (7875), 63 states have internal predecessors, (7875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:26:18,284 INFO L81 ComplementDD]: Finished complementDD. Result has 63 states, 63 states have (on average 125.0) internal successors, (7875), 63 states have internal predecessors, (7875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:26:18,284 INFO L186 Difference]: Start difference. First operand has 168 places, 150 transitions, 950 flow. Second operand 62 states and 5562 transitions. [2022-01-19 00:26:18,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 1042 transitions, 10193 flow [2022-01-19 00:26:18,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 1042 transitions, 10016 flow, removed 66 selfloop flow, removed 7 redundant places. [2022-01-19 00:26:18,592 INFO L242 Difference]: Finished difference. Result has 246 places, 477 transitions, 5187 flow [2022-01-19 00:26:18,592 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=891, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=62, PETRI_FLOW=5187, PETRI_PLACES=246, PETRI_TRANSITIONS=477} [2022-01-19 00:26:18,593 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 135 predicate places. [2022-01-19 00:26:18,593 INFO L470 AbstractCegarLoop]: Abstraction has has 246 places, 477 transitions, 5187 flow [2022-01-19 00:26:18,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 80.5925925925926) internal successors, (2176), 27 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:26:18,594 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:26:18,594 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:26:18,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-19 00:26:18,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:26:18,798 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 00:26:18,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:26:18,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1173434807, now seen corresponding path program 2 times [2022-01-19 00:26:18,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:26:18,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141953553] [2022-01-19 00:26:18,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:26:18,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:26:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:26:19,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:26:19,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:26:19,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141953553] [2022-01-19 00:26:19,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141953553] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 00:26:19,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436235446] [2022-01-19 00:26:19,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 00:26:19,182 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:26:19,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 00:26:19,183 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 00:26:19,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-19 00:26:19,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 00:26:19,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 00:26:19,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 19 conjunts are in the unsatisfiable core [2022-01-19 00:26:19,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 00:26:36,272 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-01-19 00:26:38,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:26:38,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 00:26:45,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:26:45,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436235446] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 00:26:45,976 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 00:26:45,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2022-01-19 00:26:45,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326223701] [2022-01-19 00:26:45,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 00:26:45,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 00:26:45,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:26:45,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 00:26:45,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=552, Unknown=1, NotChecked=0, Total=702 [2022-01-19 00:26:45,978 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 125 [2022-01-19 00:26:45,979 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 477 transitions, 5187 flow. Second operand has 27 states, 27 states have (on average 80.62962962962963) internal successors, (2177), 27 states have internal predecessors, (2177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:26:45,979 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:26:45,979 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 125 [2022-01-19 00:26:45,979 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:26:48,547 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:26:50,555 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:26:59,852 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:27:01,969 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:27:04,033 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:27:06,048 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:27:09,435 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:27:11,002 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:27:19,457 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:27:20,748 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:27:26,245 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:27:33,498 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:27:35,520 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:27:44,434 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:27:46,442 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:27:47,722 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:27:49,967 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:27:55,447 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:27:59,280 INFO L129 PetriNetUnfolder]: 15976/28242 cut-off events. [2022-01-19 00:27:59,280 INFO L130 PetriNetUnfolder]: For 233337/236108 co-relation queries the response was YES. [2022-01-19 00:27:59,483 INFO L84 FinitePrefix]: Finished finitePrefix Result has 152599 conditions, 28242 events. 15976/28242 cut-off events. For 233337/236108 co-relation queries the response was YES. Maximal size of possible extension queue 1712. Compared 249825 event pairs, 2744 based on Foata normal form. 27/27047 useless extension candidates. Maximal degree in co-relation 152543. Up to 15019 conditions per place. [2022-01-19 00:27:59,707 INFO L132 encePairwiseOnDemand]: 109/125 looper letters, 439 selfloop transitions, 360 changer transitions 10/871 dead transitions. [2022-01-19 00:27:59,707 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 871 transitions, 11349 flow [2022-01-19 00:27:59,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-19 00:27:59,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-01-19 00:27:59,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2127 transitions. [2022-01-19 00:27:59,714 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.709 [2022-01-19 00:27:59,714 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2127 transitions. [2022-01-19 00:27:59,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2127 transitions. [2022-01-19 00:27:59,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:27:59,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2127 transitions. [2022-01-19 00:27:59,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 88.625) internal successors, (2127), 24 states have internal predecessors, (2127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:27:59,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 125.0) internal successors, (3125), 25 states have internal predecessors, (3125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:27:59,727 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 125.0) internal successors, (3125), 25 states have internal predecessors, (3125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:27:59,728 INFO L186 Difference]: Start difference. First operand has 246 places, 477 transitions, 5187 flow. Second operand 24 states and 2127 transitions. [2022-01-19 00:27:59,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 871 transitions, 11349 flow [2022-01-19 00:28:01,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 871 transitions, 10464 flow, removed 430 selfloop flow, removed 10 redundant places. [2022-01-19 00:28:01,442 INFO L242 Difference]: Finished difference. Result has 265 places, 675 transitions, 8474 flow [2022-01-19 00:28:01,443 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=4550, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=8474, PETRI_PLACES=265, PETRI_TRANSITIONS=675} [2022-01-19 00:28:01,443 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 154 predicate places. [2022-01-19 00:28:01,443 INFO L470 AbstractCegarLoop]: Abstraction has has 265 places, 675 transitions, 8474 flow [2022-01-19 00:28:01,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 80.62962962962963) internal successors, (2177), 27 states have internal predecessors, (2177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:28:01,444 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:28:01,444 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:28:01,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-19 00:28:01,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:28:01,648 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 00:28:01,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:28:01,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1384236745, now seen corresponding path program 1 times [2022-01-19 00:28:01,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:28:01,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498116674] [2022-01-19 00:28:01,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:28:01,649 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:28:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:28:02,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:28:02,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:28:02,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498116674] [2022-01-19 00:28:02,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498116674] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 00:28:02,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87776090] [2022-01-19 00:28:02,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:28:02,114 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:28:02,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 00:28:02,124 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 00:28:02,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-19 00:28:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:28:02,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 19 conjunts are in the unsatisfiable core [2022-01-19 00:28:02,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 00:28:17,534 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-01-19 00:28:19,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:28:19,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 00:28:53,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:28:53,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87776090] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 00:28:53,404 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 00:28:53,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2022-01-19 00:28:53,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239271702] [2022-01-19 00:28:53,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 00:28:53,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 00:28:53,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:28:53,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 00:28:53,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=540, Unknown=5, NotChecked=0, Total=702 [2022-01-19 00:28:53,407 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 125 [2022-01-19 00:28:53,408 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 675 transitions, 8474 flow. Second operand has 27 states, 27 states have (on average 80.74074074074075) internal successors, (2180), 27 states have internal predecessors, (2180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:28:53,408 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:28:53,408 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 125 [2022-01-19 00:28:53,408 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:28:56,656 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:28:58,663 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:29:07,272 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:29:09,282 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:29:11,490 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:29:13,525 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2022-01-19 00:29:21,157 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-19 00:29:21,158 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-19 00:29:21,161 WARN L244 SmtUtils]: Removed 3 from assertion stack [2022-01-19 00:29:21,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 00:29:21,162 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-01-19 00:29:21,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-19 00:29:21,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-19 00:29:21,363 WARN L594 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 71 for 1ms.. [2022-01-19 00:29:21,364 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 5 remaining) [2022-01-19 00:29:21,364 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 5 remaining) [2022-01-19 00:29:21,364 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 5 remaining) [2022-01-19 00:29:21,364 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATION (0 of 5 remaining) [2022-01-19 00:29:21,366 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1] [2022-01-19 00:29:21,368 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 00:29:21,368 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 00:29:21,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 12:29:21 BasicIcfg [2022-01-19 00:29:21,370 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 00:29:21,370 INFO L158 Benchmark]: Toolchain (without parser) took 872919.35ms. Allocated memory was 394.3MB in the beginning and 973.1MB in the end (delta: 578.8MB). Free memory was 338.2MB in the beginning and 356.4MB in the end (delta: -18.2MB). Peak memory consumption was 562.0MB. Max. memory is 16.0GB. [2022-01-19 00:29:21,370 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 394.3MB. Free memory is still 355.3MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 00:29:21,370 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.59ms. Allocated memory is still 394.3MB. Free memory was 338.0MB in the beginning and 364.1MB in the end (delta: -26.1MB). Peak memory consumption was 11.1MB. Max. memory is 16.0GB. [2022-01-19 00:29:21,370 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.33ms. Allocated memory is still 394.3MB. Free memory was 364.1MB in the beginning and 362.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 00:29:21,370 INFO L158 Benchmark]: Boogie Preprocessor took 16.47ms. Allocated memory is still 394.3MB. Free memory was 362.0MB in the beginning and 361.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 00:29:21,370 INFO L158 Benchmark]: RCFGBuilder took 287.30ms. Allocated memory is still 394.3MB. Free memory was 361.0MB in the beginning and 346.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2022-01-19 00:29:21,371 INFO L158 Benchmark]: TraceAbstraction took 872406.16ms. Allocated memory was 394.3MB in the beginning and 973.1MB in the end (delta: 578.8MB). Free memory was 346.3MB in the beginning and 356.4MB in the end (delta: -10.1MB). Peak memory consumption was 571.9MB. Max. memory is 16.0GB. [2022-01-19 00:29:21,378 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 394.3MB. Free memory is still 355.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 171.59ms. Allocated memory is still 394.3MB. Free memory was 338.0MB in the beginning and 364.1MB in the end (delta: -26.1MB). Peak memory consumption was 11.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 34.33ms. Allocated memory is still 394.3MB. Free memory was 364.1MB in the beginning and 362.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 16.47ms. Allocated memory is still 394.3MB. Free memory was 362.0MB in the beginning and 361.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 287.30ms. Allocated memory is still 394.3MB. Free memory was 361.0MB in the beginning and 346.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * TraceAbstraction took 872406.16ms. Allocated memory was 394.3MB in the beginning and 973.1MB in the end (delta: 578.8MB). Free memory was 346.3MB in the beginning and 356.4MB in the end (delta: -10.1MB). Peak memory consumption was 571.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 71 for 1ms.. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 71 for 1ms.. - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 71 for 1ms.. - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 71 for 1ms.. - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 71 for 1ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 140 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 872.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 744.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 97 mSolverCounterUnknown, 2215 SdHoareTripleChecker+Valid, 382.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2215 mSDsluCounter, 655 SdHoareTripleChecker+Invalid, 378.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2033 mSDsCounter, 254 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6467 IncrementalHoareTripleChecker+Invalid, 6818 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 254 mSolverCounterUnsat, 192 mSDtfsCounter, 6467 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1129 GetRequests, 904 SyntacticMatches, 7 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2721 ImplicationChecksByTransitivity, 437.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8474occurred in iteration=11, InterpolantAutomatonStates: 155, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 125.4s InterpolantComputationTime, 1606 NumberOfCodeBlocks, 1606 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2060 ConstructedInterpolants, 0 QuantifiedInterpolants, 44858 SizeOfPredicates, 59 NumberOfNonLiveVariables, 1264 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 22 InterpolantComputations, 7 PerfectInterpolantSequences, 6/29 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown