/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/weaver/chl-node-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-8c2bbc9 [2021-10-08 15:45:59,511 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-08 15:45:59,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-08 15:45:59,549 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-08 15:45:59,549 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-08 15:45:59,551 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-08 15:45:59,553 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-08 15:45:59,555 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-08 15:45:59,557 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-08 15:45:59,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-08 15:45:59,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-08 15:45:59,569 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-08 15:45:59,569 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-08 15:45:59,571 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-08 15:45:59,573 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-08 15:45:59,574 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-08 15:45:59,575 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-08 15:45:59,577 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-08 15:45:59,579 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-08 15:45:59,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-08 15:45:59,583 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-08 15:45:59,586 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-08 15:45:59,588 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-08 15:45:59,589 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-08 15:45:59,592 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-08 15:45:59,593 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-08 15:45:59,593 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-08 15:45:59,594 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-08 15:45:59,595 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-08 15:45:59,596 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-08 15:45:59,597 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-08 15:45:59,598 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-08 15:45:59,599 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-08 15:45:59,600 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-08 15:45:59,601 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-08 15:45:59,601 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-08 15:45:59,602 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-08 15:45:59,603 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-08 15:45:59,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-08 15:45:59,604 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-08 15:45:59,605 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-08 15:45:59,606 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2021-10-08 15:45:59,634 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-08 15:45:59,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-08 15:45:59,635 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-08 15:45:59,635 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-08 15:45:59,637 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-08 15:45:59,637 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-08 15:45:59,637 INFO L138 SettingsManager]: * Use SBE=true [2021-10-08 15:45:59,638 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-08 15:45:59,638 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-08 15:45:59,638 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-08 15:45:59,638 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-08 15:45:59,638 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-08 15:45:59,639 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-08 15:45:59,639 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-08 15:45:59,639 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-08 15:45:59,639 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-08 15:45:59,639 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-10-08 15:45:59,640 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-08 15:45:59,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-08 15:45:59,640 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-08 15:45:59,640 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-08 15:45:59,640 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-08 15:45:59,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-08 15:45:59,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-08 15:45:59,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-08 15:45:59,641 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-08 15:45:59,641 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-08 15:45:59,642 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-08 15:45:59,642 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-08 15:45:59,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-08 15:45:59,642 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-08 15:45:59,642 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-08 15:45:59,643 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-2/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 [2021-10-08 15:46:00,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-08 15:46:00,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-08 15:46:00,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-08 15:46:00,051 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-08 15:46:00,052 INFO L275 PluginConnector]: CDTParser initialized [2021-10-08 15:46:00,053 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-subst.wvr.c [2021-10-08 15:46:00,145 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c21fe296f/15223d8a638d4f23b5494736ccc71d7c/FLAG20fa934f4 [2021-10-08 15:46:00,751 INFO L306 CDTParser]: Found 1 translation units. [2021-10-08 15:46:00,752 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-subst.wvr.c [2021-10-08 15:46:00,761 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c21fe296f/15223d8a638d4f23b5494736ccc71d7c/FLAG20fa934f4 [2021-10-08 15:46:01,129 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c21fe296f/15223d8a638d4f23b5494736ccc71d7c [2021-10-08 15:46:01,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-08 15:46:01,145 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-08 15:46:01,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-08 15:46:01,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-08 15:46:01,154 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-08 15:46:01,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.10 03:46:01" (1/1) ... [2021-10-08 15:46:01,156 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b047e5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 03:46:01, skipping insertion in model container [2021-10-08 15:46:01,156 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.10 03:46:01" (1/1) ... [2021-10-08 15:46:01,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-08 15:46:01,209 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-08 15:46:01,500 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-subst.wvr.c[4150,4163] [2021-10-08 15:46:01,523 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-08 15:46:01,540 INFO L203 MainTranslator]: Completed pre-run [2021-10-08 15:46:01,584 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-subst.wvr.c[4150,4163] [2021-10-08 15:46:01,590 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-08 15:46:01,608 INFO L208 MainTranslator]: Completed translation [2021-10-08 15:46:01,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 03:46:01 WrapperNode [2021-10-08 15:46:01,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-08 15:46:01,610 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-08 15:46:01,610 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-08 15:46:01,610 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-08 15:46:01,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 03:46:01" (1/1) ... [2021-10-08 15:46:01,632 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 03:46:01" (1/1) ... [2021-10-08 15:46:01,672 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-08 15:46:01,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-08 15:46:01,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-08 15:46:01,673 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-08 15:46:01,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 03:46:01" (1/1) ... [2021-10-08 15:46:01,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 03:46:01" (1/1) ... [2021-10-08 15:46:01,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 03:46:01" (1/1) ... [2021-10-08 15:46:01,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 03:46:01" (1/1) ... [2021-10-08 15:46:01,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 03:46:01" (1/1) ... [2021-10-08 15:46:01,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 03:46:01" (1/1) ... [2021-10-08 15:46:01,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 03:46:01" (1/1) ... [2021-10-08 15:46:01,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-08 15:46:01,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-08 15:46:01,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-08 15:46:01,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-08 15:46:01,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 03:46:01" (1/1) ... [2021-10-08 15:46:01,774 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-08 15:46:01,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 15:46:01,807 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-08 15:46:01,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-08 15:46:01,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-08 15:46:01,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-08 15:46:01,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-08 15:46:01,871 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-08 15:46:01,871 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-08 15:46:01,872 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-08 15:46:01,872 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-08 15:46:01,872 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-10-08 15:46:01,872 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-10-08 15:46:01,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-08 15:46:01,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-08 15:46:01,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-08 15:46:01,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-08 15:46:01,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-08 15:46:01,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-08 15:46:01,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-08 15:46:01,876 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-08 15:46:03,470 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-08 15:46:03,471 INFO L299 CfgBuilder]: Removed 56 assume(true) statements. [2021-10-08 15:46:03,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.10 03:46:03 BoogieIcfgContainer [2021-10-08 15:46:03,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-08 15:46:03,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-08 15:46:03,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-08 15:46:03,480 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-08 15:46:03,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.10 03:46:01" (1/3) ... [2021-10-08 15:46:03,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a66979c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.10 03:46:03, skipping insertion in model container [2021-10-08 15:46:03,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.10 03:46:01" (2/3) ... [2021-10-08 15:46:03,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a66979c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.10 03:46:03, skipping insertion in model container [2021-10-08 15:46:03,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.10 03:46:03" (3/3) ... [2021-10-08 15:46:03,484 INFO L111 eAbstractionObserver]: Analyzing ICFG chl-node-subst.wvr.c [2021-10-08 15:46:03,491 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-08 15:46:03,491 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-08 15:46:03,492 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2021-10-08 15:46:03,492 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-08 15:46:03,547 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,547 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,547 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,547 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,548 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,548 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,548 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,548 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,549 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,549 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,549 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,549 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,550 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,550 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,550 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,550 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,551 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,551 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,551 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,551 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,552 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,552 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,552 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,552 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,553 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,553 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,553 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,553 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,553 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,554 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,554 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,554 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,555 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,555 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,555 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,555 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,555 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,556 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,556 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,556 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,556 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,556 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,557 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,557 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,558 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,558 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,558 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,558 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,559 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,559 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,559 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,559 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,559 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,559 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,560 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,560 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,566 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,567 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,567 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,568 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,569 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,569 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,569 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,569 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,569 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,569 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,570 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,570 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,570 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,571 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,571 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,571 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,571 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,571 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,572 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,572 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,578 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,579 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,579 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,579 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,579 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,580 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,580 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,580 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,581 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,581 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,581 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,581 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,581 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,581 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,582 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,582 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,582 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,583 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,583 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,583 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,583 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,583 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,584 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,584 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,584 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,584 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,584 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,585 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,586 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,586 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,586 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,586 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,586 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,587 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,587 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,587 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,587 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,587 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,587 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,588 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,589 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,589 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,589 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,589 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,590 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,590 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,590 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,591 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,591 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,591 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,591 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,591 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,592 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,592 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,592 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,593 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,593 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,593 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,593 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,593 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,594 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,594 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,594 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,594 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,595 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,595 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,595 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,595 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,596 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,596 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,596 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,596 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,596 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,596 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,597 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,597 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,597 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,598 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,598 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,598 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,598 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,599 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,599 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,599 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,599 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,599 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,600 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,600 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,600 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,600 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,600 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,601 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,602 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,602 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,602 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,602 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,602 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,603 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,603 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,603 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,603 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,603 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,604 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,604 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,604 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,604 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,605 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,605 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,606 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,606 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,610 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,610 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,611 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,611 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,611 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~short27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,611 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,611 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,612 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,612 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,612 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,612 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,612 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,615 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,615 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,615 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,615 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,616 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,616 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,616 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,616 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,616 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,617 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,617 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,617 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~short7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,618 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~short17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,619 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,619 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,619 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,619 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,619 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,620 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,620 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,620 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,620 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,621 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,621 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-08 15:46:03,630 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-10-08 15:46:03,686 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-08 15:46:03,695 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=true, mConcurrency=FINITE_AUTOMATA, 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 [2021-10-08 15:46:03,695 INFO L340 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2021-10-08 15:46:03,719 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-08 15:46:03,733 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 375 places, 394 transitions, 812 flow [2021-10-08 15:46:03,736 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 375 places, 394 transitions, 812 flow [2021-10-08 15:46:03,738 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 375 places, 394 transitions, 812 flow [2021-10-08 15:46:03,940 INFO L129 PetriNetUnfolder]: 29/391 cut-off events. [2021-10-08 15:46:03,940 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-10-08 15:46:03,947 INFO L84 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 391 events. 29/391 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 254 event pairs, 0 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 362. Up to 2 conditions per place. [2021-10-08 15:46:03,954 INFO L116 LiptonReduction]: Number of co-enabled transitions 510 [2021-10-08 15:46:27,263 INFO L131 LiptonReduction]: Checked pairs total: 1085 [2021-10-08 15:46:27,264 INFO L133 LiptonReduction]: Total number of compositions: 471 [2021-10-08 15:46:27,275 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 65 places, 61 transitions, 146 flow [2021-10-08 15:46:27,305 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 234 states, 184 states have (on average 3.0489130434782608) internal successors, (561), 233 states have internal predecessors, (561), 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) [2021-10-08 15:46:27,309 INFO L276 IsEmpty]: Start isEmpty. Operand has 234 states, 184 states have (on average 3.0489130434782608) internal successors, (561), 233 states have internal predecessors, (561), 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) [2021-10-08 15:46:27,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2021-10-08 15:46:27,315 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:27,315 INFO L512 BasicCegarLoop]: trace histogram [1] [2021-10-08 15:46:27,316 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:27,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:27,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1714, now seen corresponding path program 1 times [2021-10-08 15:46:27,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:27,335 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473268166] [2021-10-08 15:46:27,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:27,336 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:27,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 15:46:27,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:27,456 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473268166] [2021-10-08 15:46:27,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473268166] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:27,457 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 15:46:27,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2021-10-08 15:46:27,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736759517] [2021-10-08 15:46:27,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-08 15:46:27,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:27,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-08 15:46:27,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-08 15:46:27,486 INFO L87 Difference]: Start difference. First operand has 234 states, 184 states have (on average 3.0489130434782608) internal successors, (561), 233 states have internal predecessors, (561), 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) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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) [2021-10-08 15:46:27,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:27,515 INFO L93 Difference]: Finished difference Result 232 states and 559 transitions. [2021-10-08 15:46:27,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-08 15:46:27,517 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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) Word has length 1 [2021-10-08 15:46:27,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:27,532 INFO L225 Difference]: With dead ends: 232 [2021-10-08 15:46:27,533 INFO L226 Difference]: Without dead ends: 232 [2021-10-08 15:46:27,534 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-08 15:46:27,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-10-08 15:46:27,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2021-10-08 15:46:27,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 184 states have (on average 3.0380434782608696) internal successors, (559), 231 states have internal predecessors, (559), 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) [2021-10-08 15:46:27,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 559 transitions. [2021-10-08 15:46:27,598 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 559 transitions. Word has length 1 [2021-10-08 15:46:27,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:27,599 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 559 transitions. [2021-10-08 15:46:27,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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) [2021-10-08 15:46:27,600 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 559 transitions. [2021-10-08 15:46:27,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-08 15:46:27,600 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:27,600 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-08 15:46:27,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-08 15:46:27,601 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:27,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:27,602 INFO L82 PathProgramCache]: Analyzing trace with hash 54674, now seen corresponding path program 1 times [2021-10-08 15:46:27,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:27,603 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675239048] [2021-10-08 15:46:27,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:27,603 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:27,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 15:46:27,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:27,750 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675239048] [2021-10-08 15:46:27,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675239048] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:27,751 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 15:46:27,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-08 15:46:27,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208171752] [2021-10-08 15:46:27,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 15:46:27,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:27,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 15:46:27,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:27,756 INFO L87 Difference]: Start difference. First operand 232 states and 559 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2021-10-08 15:46:27,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:27,808 INFO L93 Difference]: Finished difference Result 230 states and 557 transitions. [2021-10-08 15:46:27,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 15:46:27,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2021-10-08 15:46:27,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:27,813 INFO L225 Difference]: With dead ends: 230 [2021-10-08 15:46:27,813 INFO L226 Difference]: Without dead ends: 230 [2021-10-08 15:46:27,814 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:27,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-10-08 15:46:27,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2021-10-08 15:46:27,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 184 states have (on average 3.027173913043478) internal successors, (557), 229 states have internal predecessors, (557), 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) [2021-10-08 15:46:27,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 557 transitions. [2021-10-08 15:46:27,855 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 557 transitions. Word has length 2 [2021-10-08 15:46:27,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:27,857 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 557 transitions. [2021-10-08 15:46:27,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2021-10-08 15:46:27,857 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 557 transitions. [2021-10-08 15:46:27,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-08 15:46:27,858 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:27,858 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-08 15:46:27,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-08 15:46:27,859 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:27,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:27,862 INFO L82 PathProgramCache]: Analyzing trace with hash 54722, now seen corresponding path program 1 times [2021-10-08 15:46:27,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:27,863 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812197626] [2021-10-08 15:46:27,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:27,863 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:27,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 15:46:27,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:27,975 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812197626] [2021-10-08 15:46:27,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812197626] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:27,976 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 15:46:27,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-08 15:46:27,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019933861] [2021-10-08 15:46:27,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 15:46:27,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:27,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 15:46:27,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:27,978 INFO L87 Difference]: Start difference. First operand 230 states and 557 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2021-10-08 15:46:28,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:28,009 INFO L93 Difference]: Finished difference Result 228 states and 555 transitions. [2021-10-08 15:46:28,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 15:46:28,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2021-10-08 15:46:28,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:28,013 INFO L225 Difference]: With dead ends: 228 [2021-10-08 15:46:28,013 INFO L226 Difference]: Without dead ends: 228 [2021-10-08 15:46:28,013 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:28,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-10-08 15:46:28,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2021-10-08 15:46:28,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 184 states have (on average 3.016304347826087) internal successors, (555), 227 states have internal predecessors, (555), 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) [2021-10-08 15:46:28,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 555 transitions. [2021-10-08 15:46:28,029 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 555 transitions. Word has length 2 [2021-10-08 15:46:28,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:28,029 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 555 transitions. [2021-10-08 15:46:28,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2021-10-08 15:46:28,030 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 555 transitions. [2021-10-08 15:46:28,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-08 15:46:28,030 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:28,030 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-08 15:46:28,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-08 15:46:28,031 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:28,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:28,032 INFO L82 PathProgramCache]: Analyzing trace with hash 54728, now seen corresponding path program 1 times [2021-10-08 15:46:28,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:28,032 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369243304] [2021-10-08 15:46:28,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:28,033 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:28,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 15:46:28,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:28,135 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369243304] [2021-10-08 15:46:28,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369243304] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:28,136 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 15:46:28,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-08 15:46:28,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85049042] [2021-10-08 15:46:28,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 15:46:28,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:28,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 15:46:28,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:28,139 INFO L87 Difference]: Start difference. First operand 228 states and 555 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2021-10-08 15:46:28,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:28,220 INFO L93 Difference]: Finished difference Result 449 states and 1103 transitions. [2021-10-08 15:46:28,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 15:46:28,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2021-10-08 15:46:28,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:28,225 INFO L225 Difference]: With dead ends: 449 [2021-10-08 15:46:28,225 INFO L226 Difference]: Without dead ends: 449 [2021-10-08 15:46:28,226 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:28,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-10-08 15:46:28,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 231. [2021-10-08 15:46:28,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 187 states have (on average 3.021390374331551) internal successors, (565), 230 states have internal predecessors, (565), 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) [2021-10-08 15:46:28,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 565 transitions. [2021-10-08 15:46:28,246 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 565 transitions. Word has length 2 [2021-10-08 15:46:28,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:28,246 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 565 transitions. [2021-10-08 15:46:28,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2021-10-08 15:46:28,247 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 565 transitions. [2021-10-08 15:46:28,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-08 15:46:28,248 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:28,248 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-08 15:46:28,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-08 15:46:28,248 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:28,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:28,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1699628, now seen corresponding path program 1 times [2021-10-08 15:46:28,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:28,249 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313837447] [2021-10-08 15:46:28,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:28,250 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:28,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 15:46:28,318 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:28,318 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313837447] [2021-10-08 15:46:28,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313837447] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:28,319 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 15:46:28,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-08 15:46:28,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49877087] [2021-10-08 15:46:28,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 15:46:28,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:28,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 15:46:28,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:28,324 INFO L87 Difference]: Start difference. First operand 231 states and 565 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2021-10-08 15:46:28,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:28,364 INFO L93 Difference]: Finished difference Result 229 states and 562 transitions. [2021-10-08 15:46:28,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 15:46:28,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Word has length 3 [2021-10-08 15:46:28,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:28,368 INFO L225 Difference]: With dead ends: 229 [2021-10-08 15:46:28,368 INFO L226 Difference]: Without dead ends: 229 [2021-10-08 15:46:28,368 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:28,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-10-08 15:46:28,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2021-10-08 15:46:28,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 187 states have (on average 3.0053475935828877) internal successors, (562), 228 states have internal predecessors, (562), 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) [2021-10-08 15:46:28,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 562 transitions. [2021-10-08 15:46:28,381 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 562 transitions. Word has length 3 [2021-10-08 15:46:28,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:28,382 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 562 transitions. [2021-10-08 15:46:28,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2021-10-08 15:46:28,382 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 562 transitions. [2021-10-08 15:46:28,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-08 15:46:28,383 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:28,383 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-08 15:46:28,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-08 15:46:28,383 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:28,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:28,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1699629, now seen corresponding path program 1 times [2021-10-08 15:46:28,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:28,385 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812491704] [2021-10-08 15:46:28,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:28,385 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:28,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 15:46:28,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:28,465 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812491704] [2021-10-08 15:46:28,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812491704] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:28,466 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 15:46:28,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-08 15:46:28,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511002471] [2021-10-08 15:46:28,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 15:46:28,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:28,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 15:46:28,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:28,468 INFO L87 Difference]: Start difference. First operand 229 states and 562 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2021-10-08 15:46:28,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:28,494 INFO L93 Difference]: Finished difference Result 227 states and 559 transitions. [2021-10-08 15:46:28,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 15:46:28,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Word has length 3 [2021-10-08 15:46:28,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:28,499 INFO L225 Difference]: With dead ends: 227 [2021-10-08 15:46:28,499 INFO L226 Difference]: Without dead ends: 227 [2021-10-08 15:46:28,500 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:28,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-10-08 15:46:28,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2021-10-08 15:46:28,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 187 states have (on average 2.9893048128342246) internal successors, (559), 226 states have internal predecessors, (559), 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) [2021-10-08 15:46:28,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 559 transitions. [2021-10-08 15:46:28,524 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 559 transitions. Word has length 3 [2021-10-08 15:46:28,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:28,524 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 559 transitions. [2021-10-08 15:46:28,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2021-10-08 15:46:28,524 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 559 transitions. [2021-10-08 15:46:28,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-08 15:46:28,525 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:28,525 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-08 15:46:28,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-08 15:46:28,526 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:28,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:28,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1698255, now seen corresponding path program 1 times [2021-10-08 15:46:28,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:28,528 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839229133] [2021-10-08 15:46:28,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:28,549 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:28,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 15:46:28,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:28,633 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839229133] [2021-10-08 15:46:28,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839229133] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 15:46:28,633 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810060632] [2021-10-08 15:46:28,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:28,633 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 15:46:28,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 15:46:28,640 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-08 15:46:28,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-08 15:46:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:28,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-08 15:46:28,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 15:46:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 15:46:28,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810060632] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 15:46:28,790 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-08 15:46:28,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 3 [2021-10-08 15:46:28,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463211809] [2021-10-08 15:46:28,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-08 15:46:28,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:28,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-08 15:46:28,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-08 15:46:28,796 INFO L87 Difference]: Start difference. First operand 227 states and 559 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) [2021-10-08 15:46:28,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:28,924 INFO L93 Difference]: Finished difference Result 658 states and 1642 transitions. [2021-10-08 15:46:28,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-08 15:46:28,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) Word has length 3 [2021-10-08 15:46:28,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:28,936 INFO L225 Difference]: With dead ends: 658 [2021-10-08 15:46:28,939 INFO L226 Difference]: Without dead ends: 658 [2021-10-08 15:46:28,939 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-08 15:46:28,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2021-10-08 15:46:28,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 230. [2021-10-08 15:46:28,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 190 states have (on average 3.0) internal successors, (570), 229 states have internal predecessors, (570), 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) [2021-10-08 15:46:28,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 570 transitions. [2021-10-08 15:46:28,972 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 570 transitions. Word has length 3 [2021-10-08 15:46:28,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:28,972 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 570 transitions. [2021-10-08 15:46:28,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) [2021-10-08 15:46:28,973 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 570 transitions. [2021-10-08 15:46:28,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-08 15:46:28,973 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:28,973 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-08 15:46:29,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-08 15:46:29,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 15:46:29,193 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:29,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:29,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1698256, now seen corresponding path program 1 times [2021-10-08 15:46:29,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:29,195 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464106523] [2021-10-08 15:46:29,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:29,196 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:29,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 15:46:29,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:29,238 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464106523] [2021-10-08 15:46:29,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464106523] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 15:46:29,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650551562] [2021-10-08 15:46:29,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:29,239 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 15:46:29,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 15:46:29,245 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-08 15:46:29,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-08 15:46:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:29,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-08 15:46:29,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 15:46:29,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 15:46:29,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650551562] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:29,357 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-08 15:46:29,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2021-10-08 15:46:29,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059423950] [2021-10-08 15:46:29,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-08 15:46:29,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:29,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-08 15:46:29,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-08 15:46:29,366 INFO L87 Difference]: Start difference. First operand 230 states and 570 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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) [2021-10-08 15:46:29,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:29,438 INFO L93 Difference]: Finished difference Result 441 states and 1100 transitions. [2021-10-08 15:46:29,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-08 15:46:29,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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) Word has length 3 [2021-10-08 15:46:29,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:29,443 INFO L225 Difference]: With dead ends: 441 [2021-10-08 15:46:29,444 INFO L226 Difference]: Without dead ends: 441 [2021-10-08 15:46:29,444 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-08 15:46:29,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2021-10-08 15:46:29,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 227. [2021-10-08 15:46:29,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 190 states have (on average 2.968421052631579) internal successors, (564), 226 states have internal predecessors, (564), 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) [2021-10-08 15:46:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 564 transitions. [2021-10-08 15:46:29,458 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 564 transitions. Word has length 3 [2021-10-08 15:46:29,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:29,458 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 564 transitions. [2021-10-08 15:46:29,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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) [2021-10-08 15:46:29,459 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 564 transitions. [2021-10-08 15:46:29,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-10-08 15:46:29,459 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:29,459 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-10-08 15:46:29,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-08 15:46:29,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-10-08 15:46:29,674 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:29,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:29,677 INFO L82 PathProgramCache]: Analyzing trace with hash 52693036, now seen corresponding path program 1 times [2021-10-08 15:46:29,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:29,677 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978203157] [2021-10-08 15:46:29,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:29,678 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:29,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:29,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 15:46:29,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:29,721 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978203157] [2021-10-08 15:46:29,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978203157] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:29,721 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 15:46:29,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-08 15:46:29,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102204600] [2021-10-08 15:46:29,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 15:46:29,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:29,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 15:46:29,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:29,725 INFO L87 Difference]: Start difference. First operand 227 states and 564 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2021-10-08 15:46:29,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:29,747 INFO L93 Difference]: Finished difference Result 226 states and 561 transitions. [2021-10-08 15:46:29,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 15:46:29,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) Word has length 4 [2021-10-08 15:46:29,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:29,750 INFO L225 Difference]: With dead ends: 226 [2021-10-08 15:46:29,751 INFO L226 Difference]: Without dead ends: 226 [2021-10-08 15:46:29,751 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:29,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-10-08 15:46:29,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2021-10-08 15:46:29,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 190 states have (on average 2.9526315789473685) internal successors, (561), 225 states have internal predecessors, (561), 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) [2021-10-08 15:46:29,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 561 transitions. [2021-10-08 15:46:29,760 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 561 transitions. Word has length 4 [2021-10-08 15:46:29,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:29,761 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 561 transitions. [2021-10-08 15:46:29,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2021-10-08 15:46:29,761 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 561 transitions. [2021-10-08 15:46:29,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-10-08 15:46:29,761 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:29,761 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-10-08 15:46:29,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-08 15:46:29,762 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:29,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:29,763 INFO L82 PathProgramCache]: Analyzing trace with hash 52692989, now seen corresponding path program 1 times [2021-10-08 15:46:29,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:29,763 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103420037] [2021-10-08 15:46:29,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:29,763 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:29,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 15:46:29,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:29,828 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103420037] [2021-10-08 15:46:29,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103420037] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:29,828 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 15:46:29,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-08 15:46:29,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135243713] [2021-10-08 15:46:29,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 15:46:29,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:29,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 15:46:29,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:29,838 INFO L87 Difference]: Start difference. First operand 226 states and 561 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2021-10-08 15:46:29,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:29,864 INFO L93 Difference]: Finished difference Result 225 states and 558 transitions. [2021-10-08 15:46:29,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 15:46:29,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) Word has length 4 [2021-10-08 15:46:29,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:29,867 INFO L225 Difference]: With dead ends: 225 [2021-10-08 15:46:29,868 INFO L226 Difference]: Without dead ends: 225 [2021-10-08 15:46:29,874 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:29,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-10-08 15:46:29,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2021-10-08 15:46:29,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 190 states have (on average 2.9368421052631577) internal successors, (558), 224 states have internal predecessors, (558), 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) [2021-10-08 15:46:29,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 558 transitions. [2021-10-08 15:46:29,883 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 558 transitions. Word has length 4 [2021-10-08 15:46:29,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:29,884 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 558 transitions. [2021-10-08 15:46:29,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2021-10-08 15:46:29,884 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 558 transitions. [2021-10-08 15:46:29,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-10-08 15:46:29,885 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:29,885 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1] [2021-10-08 15:46:29,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-08 15:46:29,885 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:29,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:29,886 INFO L82 PathProgramCache]: Analyzing trace with hash 52647592, now seen corresponding path program 2 times [2021-10-08 15:46:29,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:29,886 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267599131] [2021-10-08 15:46:29,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:29,887 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:29,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 15:46:29,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:29,942 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267599131] [2021-10-08 15:46:29,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267599131] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 15:46:29,943 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447989270] [2021-10-08 15:46:29,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-08 15:46:29,944 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 15:46:29,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 15:46:29,946 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-08 15:46:29,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-08 15:46:30,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-08 15:46:30,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-08 15:46:30,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-08 15:46:30,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 15:46:30,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-08 15:46:30,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447989270] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:30,072 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-08 15:46:30,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2021-10-08 15:46:30,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002679379] [2021-10-08 15:46:30,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 15:46:30,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:30,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 15:46:30,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-08 15:46:30,075 INFO L87 Difference]: Start difference. First operand 225 states and 558 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2021-10-08 15:46:30,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:30,099 INFO L93 Difference]: Finished difference Result 222 states and 555 transitions. [2021-10-08 15:46:30,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 15:46:30,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Word has length 4 [2021-10-08 15:46:30,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:30,102 INFO L225 Difference]: With dead ends: 222 [2021-10-08 15:46:30,102 INFO L226 Difference]: Without dead ends: 222 [2021-10-08 15:46:30,102 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 11.7ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-08 15:46:30,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-10-08 15:46:30,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 216. [2021-10-08 15:46:30,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 184 states have (on average 2.9510869565217392) internal successors, (543), 215 states have internal predecessors, (543), 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) [2021-10-08 15:46:30,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 543 transitions. [2021-10-08 15:46:30,111 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 543 transitions. Word has length 4 [2021-10-08 15:46:30,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:30,111 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 543 transitions. [2021-10-08 15:46:30,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2021-10-08 15:46:30,112 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 543 transitions. [2021-10-08 15:46:30,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-08 15:46:30,112 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:30,112 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-08 15:46:30,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-08 15:46:30,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 15:46:30,328 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:30,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:30,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1633487169, now seen corresponding path program 1 times [2021-10-08 15:46:30,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:30,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827178839] [2021-10-08 15:46:30,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:30,331 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:30,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-08 15:46:30,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:30,366 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827178839] [2021-10-08 15:46:30,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827178839] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:30,366 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 15:46:30,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-08 15:46:30,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942302643] [2021-10-08 15:46:30,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 15:46:30,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:30,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 15:46:30,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:30,368 INFO L87 Difference]: Start difference. First operand 216 states and 543 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2021-10-08 15:46:30,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:30,410 INFO L93 Difference]: Finished difference Result 422 states and 1073 transitions. [2021-10-08 15:46:30,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 15:46:30,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) Word has length 5 [2021-10-08 15:46:30,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:30,414 INFO L225 Difference]: With dead ends: 422 [2021-10-08 15:46:30,415 INFO L226 Difference]: Without dead ends: 422 [2021-10-08 15:46:30,415 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:30,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-10-08 15:46:30,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 219. [2021-10-08 15:46:30,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 187 states have (on average 2.935828877005348) internal successors, (549), 218 states have internal predecessors, (549), 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) [2021-10-08 15:46:30,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 549 transitions. [2021-10-08 15:46:30,428 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 549 transitions. Word has length 5 [2021-10-08 15:46:30,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:30,429 INFO L470 AbstractCegarLoop]: Abstraction has 219 states and 549 transitions. [2021-10-08 15:46:30,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2021-10-08 15:46:30,429 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 549 transitions. [2021-10-08 15:46:30,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-08 15:46:30,430 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:30,430 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-08 15:46:30,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-08 15:46:30,430 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:30,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:30,431 INFO L82 PathProgramCache]: Analyzing trace with hash -901502508, now seen corresponding path program 1 times [2021-10-08 15:46:30,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:30,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643772602] [2021-10-08 15:46:30,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:30,438 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:30,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-08 15:46:30,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:30,496 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643772602] [2021-10-08 15:46:30,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643772602] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:30,496 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 15:46:30,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-08 15:46:30,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018236435] [2021-10-08 15:46:30,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 15:46:30,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:30,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 15:46:30,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:30,501 INFO L87 Difference]: Start difference. First operand 219 states and 549 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2021-10-08 15:46:30,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:30,519 INFO L93 Difference]: Finished difference Result 220 states and 550 transitions. [2021-10-08 15:46:30,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 15:46:30,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Word has length 6 [2021-10-08 15:46:30,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:30,522 INFO L225 Difference]: With dead ends: 220 [2021-10-08 15:46:30,522 INFO L226 Difference]: Without dead ends: 220 [2021-10-08 15:46:30,522 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-08 15:46:30,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-10-08 15:46:30,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2021-10-08 15:46:30,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 188 states have (on average 2.925531914893617) internal successors, (550), 219 states have internal predecessors, (550), 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) [2021-10-08 15:46:30,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 550 transitions. [2021-10-08 15:46:30,531 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 550 transitions. Word has length 6 [2021-10-08 15:46:30,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:30,531 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 550 transitions. [2021-10-08 15:46:30,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2021-10-08 15:46:30,532 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 550 transitions. [2021-10-08 15:46:30,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-08 15:46:30,532 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:30,532 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-08 15:46:30,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-08 15:46:30,533 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:30,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:30,533 INFO L82 PathProgramCache]: Analyzing trace with hash 806740571, now seen corresponding path program 1 times [2021-10-08 15:46:30,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:30,534 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213701716] [2021-10-08 15:46:30,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:30,537 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:30,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-08 15:46:30,592 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:30,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213701716] [2021-10-08 15:46:30,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213701716] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:30,595 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 15:46:30,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-08 15:46:30,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109025325] [2021-10-08 15:46:30,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-08 15:46:30,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:30,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-08 15:46:30,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-08 15:46:30,598 INFO L87 Difference]: Start difference. First operand 220 states and 550 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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) [2021-10-08 15:46:30,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:30,652 INFO L93 Difference]: Finished difference Result 221 states and 551 transitions. [2021-10-08 15:46:30,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-08 15:46:30,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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) Word has length 7 [2021-10-08 15:46:30,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:30,655 INFO L225 Difference]: With dead ends: 221 [2021-10-08 15:46:30,655 INFO L226 Difference]: Without dead ends: 221 [2021-10-08 15:46:30,655 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-08 15:46:30,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-10-08 15:46:30,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2021-10-08 15:46:30,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 189 states have (on average 2.9153439153439153) internal successors, (551), 220 states have internal predecessors, (551), 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) [2021-10-08 15:46:30,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 551 transitions. [2021-10-08 15:46:30,664 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 551 transitions. Word has length 7 [2021-10-08 15:46:30,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:30,664 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 551 transitions. [2021-10-08 15:46:30,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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) [2021-10-08 15:46:30,664 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 551 transitions. [2021-10-08 15:46:30,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-08 15:46:30,665 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:30,665 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 15:46:30,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-08 15:46:30,665 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:30,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:30,666 INFO L82 PathProgramCache]: Analyzing trace with hash -826468999, now seen corresponding path program 1 times [2021-10-08 15:46:30,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:30,666 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309149795] [2021-10-08 15:46:30,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:30,667 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:30,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-08 15:46:30,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:30,716 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309149795] [2021-10-08 15:46:30,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309149795] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:30,717 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 15:46:30,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-08 15:46:30,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202526618] [2021-10-08 15:46:30,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-08 15:46:30,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:30,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-08 15:46:30,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-08 15:46:30,719 INFO L87 Difference]: Start difference. First operand 221 states and 551 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2021-10-08 15:46:30,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:30,771 INFO L93 Difference]: Finished difference Result 222 states and 552 transitions. [2021-10-08 15:46:30,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-08 15:46:30,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 8 [2021-10-08 15:46:30,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:30,774 INFO L225 Difference]: With dead ends: 222 [2021-10-08 15:46:30,774 INFO L226 Difference]: Without dead ends: 222 [2021-10-08 15:46:30,774 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-08 15:46:30,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-10-08 15:46:30,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2021-10-08 15:46:30,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 190 states have (on average 2.905263157894737) internal successors, (552), 221 states have internal predecessors, (552), 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) [2021-10-08 15:46:30,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 552 transitions. [2021-10-08 15:46:30,802 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 552 transitions. Word has length 8 [2021-10-08 15:46:30,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:30,802 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 552 transitions. [2021-10-08 15:46:30,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2021-10-08 15:46:30,803 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 552 transitions. [2021-10-08 15:46:30,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-08 15:46:30,803 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:30,803 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 15:46:30,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-08 15:46:30,804 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:30,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:30,804 INFO L82 PathProgramCache]: Analyzing trace with hash 147573369, now seen corresponding path program 1 times [2021-10-08 15:46:30,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:30,805 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620391644] [2021-10-08 15:46:30,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:30,805 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:30,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-08 15:46:30,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:30,848 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620391644] [2021-10-08 15:46:30,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620391644] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 15:46:30,848 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004360141] [2021-10-08 15:46:30,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:30,848 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 15:46:30,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 15:46:30,850 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-08 15:46:30,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-08 15:46:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:30,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-08 15:46:30,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 15:46:30,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-08 15:46:30,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004360141] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:30,981 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-08 15:46:30,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2021-10-08 15:46:30,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405601601] [2021-10-08 15:46:30,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-08 15:46:30,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:30,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-08 15:46:30,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-08 15:46:30,983 INFO L87 Difference]: Start difference. First operand 222 states and 552 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) [2021-10-08 15:46:31,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:31,023 INFO L93 Difference]: Finished difference Result 422 states and 1073 transitions. [2021-10-08 15:46:31,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-08 15:46:31,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) Word has length 9 [2021-10-08 15:46:31,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:31,028 INFO L225 Difference]: With dead ends: 422 [2021-10-08 15:46:31,028 INFO L226 Difference]: Without dead ends: 422 [2021-10-08 15:46:31,029 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-08 15:46:31,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-10-08 15:46:31,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 219. [2021-10-08 15:46:31,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 190 states have (on average 2.889473684210526) internal successors, (549), 218 states have internal predecessors, (549), 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) [2021-10-08 15:46:31,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 549 transitions. [2021-10-08 15:46:31,041 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 549 transitions. Word has length 9 [2021-10-08 15:46:31,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:31,041 INFO L470 AbstractCegarLoop]: Abstraction has 219 states and 549 transitions. [2021-10-08 15:46:31,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) [2021-10-08 15:46:31,042 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 549 transitions. [2021-10-08 15:46:31,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-08 15:46:31,042 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:31,043 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 15:46:31,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-08 15:46:31,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-10-08 15:46:31,256 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:31,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:31,257 INFO L82 PathProgramCache]: Analyzing trace with hash 147573370, now seen corresponding path program 1 times [2021-10-08 15:46:31,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:31,257 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723070691] [2021-10-08 15:46:31,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:31,258 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:31,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:31,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-08 15:46:31,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:31,303 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723070691] [2021-10-08 15:46:31,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723070691] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 15:46:31,304 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156284539] [2021-10-08 15:46:31,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:31,304 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 15:46:31,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 15:46:31,305 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-08 15:46:31,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-08 15:46:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:31,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-08 15:46:31,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 15:46:31,433 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-08 15:46:31,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156284539] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 15:46:31,433 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-08 15:46:31,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2021-10-08 15:46:31,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980555309] [2021-10-08 15:46:31,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-08 15:46:31,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:31,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-08 15:46:31,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-08 15:46:31,435 INFO L87 Difference]: Start difference. First operand 219 states and 549 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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) [2021-10-08 15:46:31,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:31,482 INFO L93 Difference]: Finished difference Result 628 states and 1603 transitions. [2021-10-08 15:46:31,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-08 15:46:31,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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) Word has length 9 [2021-10-08 15:46:31,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:31,488 INFO L225 Difference]: With dead ends: 628 [2021-10-08 15:46:31,488 INFO L226 Difference]: Without dead ends: 628 [2021-10-08 15:46:31,489 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-08 15:46:31,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2021-10-08 15:46:31,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 222. [2021-10-08 15:46:31,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 193 states have (on average 2.8756476683937824) internal successors, (555), 221 states have internal predecessors, (555), 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) [2021-10-08 15:46:31,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 555 transitions. [2021-10-08 15:46:31,502 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 555 transitions. Word has length 9 [2021-10-08 15:46:31,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:31,502 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 555 transitions. [2021-10-08 15:46:31,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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) [2021-10-08 15:46:31,502 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 555 transitions. [2021-10-08 15:46:31,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-08 15:46:31,503 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:31,503 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 15:46:31,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-08 15:46:31,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-10-08 15:46:31,717 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:31,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:31,718 INFO L82 PathProgramCache]: Analyzing trace with hash 279809949, now seen corresponding path program 2 times [2021-10-08 15:46:31,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:31,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991245237] [2021-10-08 15:46:31,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:31,720 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:31,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-08 15:46:31,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:31,797 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991245237] [2021-10-08 15:46:31,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991245237] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 15:46:31,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196093737] [2021-10-08 15:46:31,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-08 15:46:31,798 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 15:46:31,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 15:46:31,800 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-08 15:46:31,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-10-08 15:46:31,914 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-08 15:46:31,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-08 15:46:31,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-08 15:46:31,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 15:46:31,949 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-08 15:46:31,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196093737] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:31,949 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-08 15:46:31,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 8 [2021-10-08 15:46:31,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191704950] [2021-10-08 15:46:31,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-08 15:46:31,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:31,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-08 15:46:31,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-08 15:46:31,951 INFO L87 Difference]: Start difference. First operand 222 states and 555 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2021-10-08 15:46:31,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:31,968 INFO L93 Difference]: Finished difference Result 219 states and 552 transitions. [2021-10-08 15:46:31,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-08 15:46:31,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) Word has length 10 [2021-10-08 15:46:31,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:31,971 INFO L225 Difference]: With dead ends: 219 [2021-10-08 15:46:31,971 INFO L226 Difference]: Without dead ends: 219 [2021-10-08 15:46:31,971 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 28.2ms TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-08 15:46:31,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-10-08 15:46:31,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 213. [2021-10-08 15:46:31,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 187 states have (on average 2.8877005347593583) internal successors, (540), 212 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) [2021-10-08 15:46:31,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 540 transitions. [2021-10-08 15:46:31,980 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 540 transitions. Word has length 10 [2021-10-08 15:46:31,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:31,981 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 540 transitions. [2021-10-08 15:46:31,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2021-10-08 15:46:31,981 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 540 transitions. [2021-10-08 15:46:31,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-08 15:46:31,982 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:31,982 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 15:46:32,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-10-08 15:46:32,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-10-08 15:46:32,195 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:32,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:32,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1615129473, now seen corresponding path program 1 times [2021-10-08 15:46:32,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:32,197 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564864734] [2021-10-08 15:46:32,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:32,197 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:32,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-08 15:46:32,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:32,289 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564864734] [2021-10-08 15:46:32,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564864734] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:32,290 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 15:46:32,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-08 15:46:32,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403708163] [2021-10-08 15:46:32,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-08 15:46:32,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:32,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-08 15:46:32,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-08 15:46:32,291 INFO L87 Difference]: Start difference. First operand 213 states and 540 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2021-10-08 15:46:32,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:32,338 INFO L93 Difference]: Finished difference Result 214 states and 541 transitions. [2021-10-08 15:46:32,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-08 15:46:32,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Word has length 12 [2021-10-08 15:46:32,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:32,341 INFO L225 Difference]: With dead ends: 214 [2021-10-08 15:46:32,341 INFO L226 Difference]: Without dead ends: 214 [2021-10-08 15:46:32,342 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-08 15:46:32,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-10-08 15:46:32,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2021-10-08 15:46:32,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 188 states have (on average 2.877659574468085) internal successors, (541), 213 states have internal predecessors, (541), 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) [2021-10-08 15:46:32,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 541 transitions. [2021-10-08 15:46:32,350 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 541 transitions. Word has length 12 [2021-10-08 15:46:32,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:32,350 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 541 transitions. [2021-10-08 15:46:32,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2021-10-08 15:46:32,350 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 541 transitions. [2021-10-08 15:46:32,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-08 15:46:32,351 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:32,351 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 15:46:32,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-08 15:46:32,351 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:32,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:32,352 INFO L82 PathProgramCache]: Analyzing trace with hash -640214916, now seen corresponding path program 1 times [2021-10-08 15:46:32,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:32,352 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116798708] [2021-10-08 15:46:32,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:32,353 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:32,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-08 15:46:32,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:32,429 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116798708] [2021-10-08 15:46:32,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116798708] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-08 15:46:32,429 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786138460] [2021-10-08 15:46:32,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:32,430 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 15:46:32,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-08 15:46:32,431 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-08 15:46:32,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-10-08 15:46:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:32,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-08 15:46:32,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-08 15:46:32,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-08 15:46:32,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786138460] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:32,603 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-08 15:46:32,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-10-08 15:46:32,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278257896] [2021-10-08 15:46:32,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-08 15:46:32,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:32,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-08 15:46:32,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-08 15:46:32,605 INFO L87 Difference]: Start difference. First operand 214 states and 541 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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) [2021-10-08 15:46:32,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:32,654 INFO L93 Difference]: Finished difference Result 215 states and 542 transitions. [2021-10-08 15:46:32,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-08 15:46:32,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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) Word has length 13 [2021-10-08 15:46:32,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:32,657 INFO L225 Difference]: With dead ends: 215 [2021-10-08 15:46:32,657 INFO L226 Difference]: Without dead ends: 215 [2021-10-08 15:46:32,657 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 31.4ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-08 15:46:32,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-10-08 15:46:32,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2021-10-08 15:46:32,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 189 states have (on average 2.867724867724868) internal successors, (542), 214 states have internal predecessors, (542), 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) [2021-10-08 15:46:32,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 542 transitions. [2021-10-08 15:46:32,665 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 542 transitions. Word has length 13 [2021-10-08 15:46:32,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:32,666 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 542 transitions. [2021-10-08 15:46:32,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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) [2021-10-08 15:46:32,666 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 542 transitions. [2021-10-08 15:46:32,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-08 15:46:32,667 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:32,667 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 15:46:32,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-10-08 15:46:32,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-08 15:46:32,882 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:32,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:32,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1571275983, now seen corresponding path program 1 times [2021-10-08 15:46:32,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:32,883 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681769023] [2021-10-08 15:46:32,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:32,884 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-08 15:46:32,952 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-08 15:46:32,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-08 15:46:32,953 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681769023] [2021-10-08 15:46:32,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681769023] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-08 15:46:32,953 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-08 15:46:32,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-08 15:46:32,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730561458] [2021-10-08 15:46:32,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-08 15:46:32,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-08 15:46:32,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-08 15:46:32,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-08 15:46:32,957 INFO L87 Difference]: Start difference. First operand 215 states and 542 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) [2021-10-08 15:46:33,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-08 15:46:33,020 INFO L93 Difference]: Finished difference Result 216 states and 543 transitions. [2021-10-08 15:46:33,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-08 15:46:33,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) Word has length 14 [2021-10-08 15:46:33,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-08 15:46:33,023 INFO L225 Difference]: With dead ends: 216 [2021-10-08 15:46:33,023 INFO L226 Difference]: Without dead ends: 216 [2021-10-08 15:46:33,024 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-08 15:46:33,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-10-08 15:46:33,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2021-10-08 15:46:33,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 190 states have (on average 2.857894736842105) internal successors, (543), 215 states have internal predecessors, (543), 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) [2021-10-08 15:46:33,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 543 transitions. [2021-10-08 15:46:33,032 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 543 transitions. Word has length 14 [2021-10-08 15:46:33,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-08 15:46:33,032 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 543 transitions. [2021-10-08 15:46:33,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) [2021-10-08 15:46:33,033 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 543 transitions. [2021-10-08 15:46:33,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-08 15:46:33,033 INFO L504 BasicCegarLoop]: Found error trace [2021-10-08 15:46:33,033 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-08 15:46:33,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-08 15:46:33,034 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2021-10-08 15:46:33,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-08 15:46:33,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1466675595, now seen corresponding path program 1 times [2021-10-08 15:46:33,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-08 15:46:33,035 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376073500] [2021-10-08 15:46:33,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-08 15:46:33,035 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-08 15:46:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-08 15:46:33,113 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-08 15:46:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-08 15:46:33,218 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-08 15:46:33,218 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-08 15:46:33,220 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,224 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,224 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,225 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,225 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,225 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,225 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,226 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,226 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,226 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,226 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,226 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,227 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,227 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,227 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,227 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,227 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,227 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,229 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,229 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,229 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,232 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,232 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-08 15:46:33,232 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-08 15:46:33,232 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-08 15:46:33,232 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,233 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,233 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,233 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,233 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-10-08 15:46:33,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-08 15:46:33,242 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-08 15:46:33,243 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-08 15:46:33,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.10 03:46:33 BasicIcfg [2021-10-08 15:46:33,384 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-08 15:46:33,385 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-08 15:46:33,385 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-08 15:46:33,385 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-08 15:46:33,386 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.10 03:46:03" (3/4) ... [2021-10-08 15:46:33,388 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-08 15:46:33,504 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/weaver/chl-node-subst.wvr.c-witness.graphml [2021-10-08 15:46:33,504 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-08 15:46:33,506 INFO L168 Benchmark]: Toolchain (without parser) took 32369.01 ms. Allocated memory was 156.2 MB in the beginning and 235.9 MB in the end (delta: 79.7 MB). Free memory was 130.4 MB in the beginning and 157.2 MB in the end (delta: -26.8 MB). Peak memory consumption was 53.2 MB. Max. memory is 8.0 GB. [2021-10-08 15:46:33,507 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 156.2 MB. Free memory is still 127.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-10-08 15:46:33,507 INFO L168 Benchmark]: CACSL2BoogieTranslator took 459.95 ms. Allocated memory is still 156.2 MB. Free memory was 130.0 MB in the beginning and 117.9 MB in the end (delta: 12.2 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2021-10-08 15:46:33,508 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.61 ms. Allocated memory is still 156.2 MB. Free memory was 117.7 MB in the beginning and 115.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-10-08 15:46:33,508 INFO L168 Benchmark]: Boogie Preprocessor took 84.17 ms. Allocated memory is still 156.2 MB. Free memory was 115.0 MB in the beginning and 112.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-10-08 15:46:33,508 INFO L168 Benchmark]: RCFGBuilder took 1716.15 ms. Allocated memory is still 156.2 MB. Free memory was 112.7 MB in the beginning and 82.9 MB in the end (delta: 29.8 MB). Peak memory consumption was 29.0 MB. Max. memory is 8.0 GB. [2021-10-08 15:46:33,509 INFO L168 Benchmark]: TraceAbstraction took 29907.59 ms. Allocated memory was 156.2 MB in the beginning and 235.9 MB in the end (delta: 79.7 MB). Free memory was 82.9 MB in the beginning and 167.2 MB in the end (delta: -84.3 MB). There was no memory consumed. Max. memory is 8.0 GB. [2021-10-08 15:46:33,509 INFO L168 Benchmark]: Witness Printer took 119.86 ms. Allocated memory is still 235.9 MB. Free memory was 167.2 MB in the beginning and 157.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2021-10-08 15:46:33,511 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.23 ms. Allocated memory is still 156.2 MB. Free memory is still 127.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 459.95 ms. Allocated memory is still 156.2 MB. Free memory was 130.0 MB in the beginning and 117.9 MB in the end (delta: 12.2 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 62.61 ms. Allocated memory is still 156.2 MB. Free memory was 117.7 MB in the beginning and 115.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 84.17 ms. Allocated memory is still 156.2 MB. Free memory was 115.0 MB in the beginning and 112.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1716.15 ms. Allocated memory is still 156.2 MB. Free memory was 112.7 MB in the beginning and 82.9 MB in the end (delta: 29.8 MB). Peak memory consumption was 29.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 29907.59 ms. Allocated memory was 156.2 MB in the beginning and 235.9 MB in the end (delta: 79.7 MB). Free memory was 82.9 MB in the beginning and 167.2 MB in the end (delta: -84.3 MB). There was no memory consumed. Max. memory is 8.0 GB. * Witness Printer took 119.86 ms. Allocated memory is still 235.9 MB. Free memory was 167.2 MB in the beginning and 157.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23527.7ms, 375 PlacesBefore, 65 PlacesAfterwards, 394 TransitionsBefore, 61 TransitionsAfterwards, 510 CoEnabledTransitionPairs, 9 FixpointIterations, 346 TrivialSequentialCompositions, 18 ConcurrentSequentialCompositions, 84 TrivialYvCompositions, 0 ConcurrentYvCompositions, 23 ChoiceCompositions, 471 TotalNumberOfCompositions, 1085 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 809, positive: 759, positive conditional: 0, positive unconditional: 759, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 314, positive: 304, positive conditional: 0, positive unconditional: 304, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 314, positive: 304, positive conditional: 0, positive unconditional: 304, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 136, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 136, negative conditional: 0, negative unconditional: 136, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 809, positive: 455, positive conditional: 0, positive unconditional: 455, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 314, unknown conditional: 0, unknown unconditional: 314] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 53, Positive conditional cache size: 0, Positive unconditional cache size: 53, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 52]: integer overflow possible integer overflow possible We found a FailurePath: [L41] 0 int id_0, id_3, id_6, result_9, order1_10, order2_11, result_12, order1_13, order2_14, result_15, order1_16, order2_17; [L42] 0 int *get_2, *get_5, *get_8; [L43] 0 _Bool *contains_key_1, *contains_key_4, *contains_key_7; [L79] 0 pthread_t t1, t2, t3; [L82] 0 id_0 = __VERIFIER_nondet_int() [L38] COND FALSE 0 !(!cond) [L84] 0 id_3 = __VERIFIER_nondet_int() [L38] COND FALSE 0 !(!cond) [L86] 0 id_6 = __VERIFIER_nondet_int() [L38] COND FALSE 0 !(!cond) [L88] 0 result_9 = __VERIFIER_nondet_int() [L89] 0 order1_10 = __VERIFIER_nondet_int() [L90] 0 order2_11 = __VERIFIER_nondet_int() [L91] 0 result_12 = __VERIFIER_nondet_int() [L92] 0 order1_13 = __VERIFIER_nondet_int() [L93] 0 order2_14 = __VERIFIER_nondet_int() [L94] 0 result_15 = __VERIFIER_nondet_int() [L95] 0 order1_16 = __VERIFIER_nondet_int() [L96] 0 order2_17 = __VERIFIER_nondet_int() [L38] COND FALSE 0 !(!cond) [L98] EXPR 0 id_0 + 1 [L38] COND FALSE 0 !(!cond) [L38] COND FALSE 0 !(!cond) [L123] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L124] 0 int i = 0; VAL [contains_key_1={0:0}, contains_key_4={0:0}, contains_key_7={0:0}, get_2={0:0}, get_5={0:0}, get_8={0:0}, id_0=0, id_3=0, id_6=0, order1_10=0, order1_13=0, order1_16=0, order2_11=0, order2_14=0, order2_17=0, result_12=0, result_15=0, result_9=0] [L124] COND TRUE 0 i < size [L125] 0 arr[i] = __VERIFIER_nondet_int() [L124] 0 i++ VAL [contains_key_1={0:0}, contains_key_4={0:0}, contains_key_7={0:0}, get_2={0:0}, get_5={0:0}, get_8={0:0}, id_0=0, id_3=0, id_6=0, order1_10=0, order1_13=0, order1_16=0, order2_11=0, order2_14=0, order2_17=0, result_12=0, result_15=0, result_9=0] [L124] COND FALSE 0 !(i < size) [L127] 0 return arr; [L98] 0 get_2 = create_fresh_int_array(id_0 + 1) [L99] EXPR 0 id_3 + 1 [L38] COND FALSE 0 !(!cond) [L38] COND FALSE 0 !(!cond) [L123] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L124] 0 int i = 0; VAL [contains_key_1={0:0}, contains_key_4={0:0}, contains_key_7={0:0}, get_2={-2:0}, get_5={0:0}, get_8={0:0}, id_0=0, id_3=0, id_6=0, order1_10=0, order1_13=0, order1_16=0, order2_11=0, order2_14=0, order2_17=0, result_12=0, result_15=0, result_9=0] [L124] COND TRUE 0 i < size [L125] 0 arr[i] = __VERIFIER_nondet_int() [L124] 0 i++ VAL [contains_key_1={0:0}, contains_key_4={0:0}, contains_key_7={0:0}, get_2={-2:0}, get_5={0:0}, get_8={0:0}, id_0=0, id_3=0, id_6=0, order1_10=0, order1_13=0, order1_16=0, order2_11=0, order2_14=0, order2_17=0, result_12=0, result_15=0, result_9=0] [L124] COND FALSE 0 !(i < size) [L127] 0 return arr; [L99] 0 get_5 = create_fresh_int_array(id_3 + 1) [L100] EXPR 0 id_6 + 1 [L38] COND FALSE 0 !(!cond) [L38] COND FALSE 0 !(!cond) [L123] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L124] 0 int i = 0; VAL [contains_key_1={0:0}, contains_key_4={0:0}, contains_key_7={0:0}, get_2={-2:0}, get_5={-4:0}, get_8={0:0}, id_0=0, id_3=0, id_6=0, order1_10=0, order1_13=0, order1_16=0, order2_11=0, order2_14=0, order2_17=0, result_12=0, result_15=0, result_9=0] [L124] COND TRUE 0 i < size [L125] 0 arr[i] = __VERIFIER_nondet_int() [L124] 0 i++ VAL [contains_key_1={0:0}, contains_key_4={0:0}, contains_key_7={0:0}, get_2={-2:0}, get_5={-4:0}, get_8={0:0}, id_0=0, id_3=0, id_6=0, order1_10=0, order1_13=0, order1_16=0, order2_11=0, order2_14=0, order2_17=0, result_12=0, result_15=0, result_9=0] [L124] COND FALSE 0 !(i < size) [L127] 0 return arr; [L100] 0 get_8 = create_fresh_int_array(id_6 + 1) [L101] EXPR 0 id_0+1 [L38] COND FALSE 0 !(!cond) [L38] COND FALSE 0 !(!cond) [L134] 0 _Bool* arr = (_Bool*)malloc(sizeof(_Bool) * (size_t)size); [L135] 0 int i = 0; VAL [contains_key_1={0:0}, contains_key_4={0:0}, contains_key_7={0:0}, get_2={-2:0}, get_5={-4:0}, get_8={-6:0}, id_0=0, id_3=0, id_6=0, order1_10=0, order1_13=0, order1_16=0, order2_11=0, order2_14=0, order2_17=0, result_12=0, result_15=0, result_9=0] [L135] COND TRUE 0 i < size [L136] 0 arr[i] = __VERIFIER_nondet_bool() [L135] 0 i++ VAL [contains_key_1={0:0}, contains_key_4={0:0}, contains_key_7={0:0}, get_2={-2:0}, get_5={-4:0}, get_8={-6:0}, id_0=0, id_3=0, id_6=0, order1_10=0, order1_13=0, order1_16=0, order2_11=0, order2_14=0, order2_17=0, result_12=0, result_15=0, result_9=0] [L135] COND FALSE 0 !(i < size) [L138] 0 return arr; [L101] 0 contains_key_1 = create_fresh_bool_array(id_0+1) [L102] EXPR 0 id_3+1 [L38] COND FALSE 0 !(!cond) [L38] COND FALSE 0 !(!cond) [L134] 0 _Bool* arr = (_Bool*)malloc(sizeof(_Bool) * (size_t)size); [L135] 0 int i = 0; VAL [contains_key_1={-8:0}, contains_key_4={0:0}, contains_key_7={0:0}, get_2={-2:0}, get_5={-4:0}, get_8={-6:0}, id_0=0, id_3=0, id_6=0, order1_10=0, order1_13=0, order1_16=0, order2_11=0, order2_14=0, order2_17=0, result_12=0, result_15=0, result_9=0] [L135] COND TRUE 0 i < size [L136] 0 arr[i] = __VERIFIER_nondet_bool() [L135] 0 i++ VAL [contains_key_1={-8:0}, contains_key_4={0:0}, contains_key_7={0:0}, get_2={-2:0}, get_5={-4:0}, get_8={-6:0}, id_0=0, id_3=0, id_6=0, order1_10=0, order1_13=0, order1_16=0, order2_11=0, order2_14=0, order2_17=0, result_12=0, result_15=0, result_9=0] [L135] COND FALSE 0 !(i < size) [L138] 0 return arr; [L102] 0 contains_key_4 = create_fresh_bool_array(id_3+1) [L103] EXPR 0 id_6+1 [L38] COND FALSE 0 !(!cond) [L38] COND FALSE 0 !(!cond) [L134] 0 _Bool* arr = (_Bool*)malloc(sizeof(_Bool) * (size_t)size); [L135] 0 int i = 0; VAL [contains_key_1={-8:0}, contains_key_4={3:0}, contains_key_7={0:0}, get_2={-2:0}, get_5={-4:0}, get_8={-6:0}, id_0=0, id_3=0, id_6=0, order1_10=0, order1_13=0, order1_16=0, order2_11=0, order2_14=0, order2_17=0, result_12=0, result_15=0, result_9=0] [L135] COND TRUE 0 i < size [L136] 0 arr[i] = __VERIFIER_nondet_bool() [L135] 0 i++ VAL [contains_key_1={-8:0}, contains_key_4={3:0}, contains_key_7={0:0}, get_2={-2:0}, get_5={-4:0}, get_8={-6:0}, id_0=0, id_3=0, id_6=0, order1_10=0, order1_13=0, order1_16=0, order2_11=0, order2_14=0, order2_17=0, result_12=0, result_15=0, result_9=0] [L135] COND FALSE 0 !(i < size) [L138] 0 return arr; [L103] 0 contains_key_7 = create_fresh_bool_array(id_6+1) [L106] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [contains_key_1={-8:0}, contains_key_4={3:0}, contains_key_7={-9:0}, get_2={-2:0}, get_5={-4:0}, get_8={-6:0}, id_0=0, id_3=0, id_6=0, order1_10=0, order1_13=0, order1_16=0, order2_11=0, order2_14=0, order2_17=0, result_12=0, result_15=0, result_9=0] [L50] EXPR 1 get_2[id_0] [L50] 1 order1_10 = get_2[id_0] [L51] EXPR 1 get_5[id_3] [L51] 1 order2_11 = get_5[id_3] [L52] EXPR 1 contains_key_1[id_0] [L52] EXPR 1 contains_key_1[id_0] && contains_key_4[id_3] [L52] 1 ( contains_key_1[id_0] && contains_key_4[id_3] ) ? ( ( order1_10 < order2_11 ) ? ( 0 - 1 ) : ( ( order1_10 > order2_11 ) ? 1 : 0 ) ) : ( get_2[id_0] - get_5[id_3] ) [L52] EXPR 1 get_2[id_0] [L52] EXPR 1 get_5[id_3] [L52] 1 get_2[id_0] - get_5[id_3] VAL [contains_key_1={-8:0}, contains_key_1[id_0]=0, contains_key_1[id_0] && contains_key_4[id_3]=0, contains_key_4={3:0}, contains_key_4[id_3]=257, contains_key_7={-9:0}, get_2={-2:0}, get_2[id_0]=10, get_5={-4:0}, get_5[id_3]=-2147483638, get_8={-6:0}, id_0=0, id_3=0, id_6=0, order1_10=10, order1_13=0, order1_16=0, order2_11=-2147483638, order2_14=0, order2_17=0, result_12=0, result_15=0, result_9=0] - UnprovableResult [Line: 52]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 99]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 124]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 99]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 124]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 100]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 124]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 100]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 124]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 101]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 124]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 101]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 124]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 135]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 102]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 135]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 102]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 135]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 103]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 135]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 103]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 135]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 135]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 387 locations, 39 error locations. Started 1 CEGAR loops. OverallTime: 29553.7ms, OverallIterations: 22, TraceHistogramMax: 2, EmptinessCheckTime: 19.6ms, AutomataDifference: 1136.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 23609.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 747 SDtfs, 839 SDslu, 371 SDs, 0 SdLazy, 316 SolverSat, 102 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 606.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 170.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=0, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 346.0ms AutomataMinimizationTime, 21 MinimizatonAttempts, 1684 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 150.4ms SsaConstructionTime, 713.5ms SatisfiabilityAnalysisTime, 1049.7ms InterpolantComputationTime, 190 NumberOfCodeBlocks, 183 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 147 ConstructedInterpolants, 0 QuantifiedInterpolants, 384 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1255 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 28 InterpolantComputations, 19 PerfectInterpolantSequences, 48/60 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 proved your program to be incorrect! [2021-10-08 15:46:33,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...