/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-44898dd [2022-02-09 00:49:22,326 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-09 00:49:22,329 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-09 00:49:22,394 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-09 00:49:22,395 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-09 00:49:22,398 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-09 00:49:22,401 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-09 00:49:22,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-09 00:49:22,406 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-09 00:49:22,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-09 00:49:22,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-09 00:49:22,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-09 00:49:22,408 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-09 00:49:22,409 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-09 00:49:22,411 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-09 00:49:22,415 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-09 00:49:22,416 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-09 00:49:22,421 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-09 00:49:22,422 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-09 00:49:22,424 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-09 00:49:22,425 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-09 00:49:22,432 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-09 00:49:22,433 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-09 00:49:22,435 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-09 00:49:22,441 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-09 00:49:22,441 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-09 00:49:22,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-09 00:49:22,442 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-09 00:49:22,442 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-09 00:49:22,443 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-09 00:49:22,445 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-09 00:49:22,445 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-09 00:49:22,447 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-09 00:49:22,447 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-09 00:49:22,449 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-09 00:49:22,449 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-09 00:49:22,449 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-09 00:49:22,449 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-09 00:49:22,450 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-09 00:49:22,450 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-09 00:49:22,451 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-09 00:49:22,452 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-02-09 00:49:22,480 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-09 00:49:22,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-09 00:49:22,481 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-09 00:49:22,481 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-09 00:49:22,481 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-09 00:49:22,482 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-09 00:49:22,482 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-09 00:49:22,482 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-09 00:49:22,482 INFO L138 SettingsManager]: * Use SBE=true [2022-02-09 00:49:22,482 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-09 00:49:22,482 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-09 00:49:22,482 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-09 00:49:22,483 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-09 00:49:22,483 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-09 00:49:22,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-09 00:49:22,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-09 00:49:22,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-09 00:49:22,483 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-09 00:49:22,483 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-09 00:49:22,483 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-09 00:49:22,483 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-09 00:49:22,484 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-09 00:49:22,484 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-09 00:49:22,484 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-09 00:49:22,484 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-09 00:49:22,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-09 00:49:22,484 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-09 00:49:22,484 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-09 00:49:22,484 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-09 00:49:22,484 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-09 00:49:22,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-09 00:49:22,484 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-09 00:49:22,485 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-09 00:49:22,485 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-02-09 00:49:22,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-09 00:49:22,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-09 00:49:22,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-09 00:49:22,730 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-09 00:49:22,732 INFO L275 PluginConnector]: CDTParser initialized [2022-02-09 00:49:22,733 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2022-02-09 00:49:22,801 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18f01094f/c1783b25fb40438988b662ac30bca020/FLAG8c5122d53 [2022-02-09 00:49:23,165 INFO L306 CDTParser]: Found 1 translation units. [2022-02-09 00:49:23,165 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2022-02-09 00:49:23,172 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18f01094f/c1783b25fb40438988b662ac30bca020/FLAG8c5122d53 [2022-02-09 00:49:23,185 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18f01094f/c1783b25fb40438988b662ac30bca020 [2022-02-09 00:49:23,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-09 00:49:23,188 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-09 00:49:23,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-09 00:49:23,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-09 00:49:23,193 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-09 00:49:23,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 12:49:23" (1/1) ... [2022-02-09 00:49:23,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fe6e545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 12:49:23, skipping insertion in model container [2022-02-09 00:49:23,195 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 12:49:23" (1/1) ... [2022-02-09 00:49:23,200 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-09 00:49:23,216 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-09 00:49:23,426 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c[3770,3783] [2022-02-09 00:49:23,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-09 00:49:23,449 INFO L203 MainTranslator]: Completed pre-run [2022-02-09 00:49:23,493 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c[3770,3783] [2022-02-09 00:49:23,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-09 00:49:23,511 INFO L208 MainTranslator]: Completed translation [2022-02-09 00:49:23,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 12:49:23 WrapperNode [2022-02-09 00:49:23,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-09 00:49:23,513 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-09 00:49:23,513 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-09 00:49:23,513 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-09 00:49:23,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 12:49:23" (1/1) ... [2022-02-09 00:49:23,542 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 12:49:23" (1/1) ... [2022-02-09 00:49:23,569 INFO L137 Inliner]: procedures = 27, calls = 73, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 245 [2022-02-09 00:49:23,569 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-09 00:49:23,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-09 00:49:23,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-09 00:49:23,570 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-09 00:49:23,576 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 12:49:23" (1/1) ... [2022-02-09 00:49:23,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 12:49:23" (1/1) ... [2022-02-09 00:49:23,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 12:49:23" (1/1) ... [2022-02-09 00:49:23,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 12:49:23" (1/1) ... [2022-02-09 00:49:23,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 12:49:23" (1/1) ... [2022-02-09 00:49:23,593 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 12:49:23" (1/1) ... [2022-02-09 00:49:23,595 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 12:49:23" (1/1) ... [2022-02-09 00:49:23,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-09 00:49:23,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-09 00:49:23,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-09 00:49:23,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-09 00:49:23,603 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 12:49:23" (1/1) ... [2022-02-09 00:49:23,609 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-09 00:49:23,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 00:49:23,631 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-09 00:49:23,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-09 00:49:23,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-09 00:49:23,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-09 00:49:23,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-09 00:49:23,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-09 00:49:23,664 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-02-09 00:49:23,664 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-02-09 00:49:23,664 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-02-09 00:49:23,664 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-02-09 00:49:23,664 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-02-09 00:49:23,665 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-02-09 00:49:23,665 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-02-09 00:49:23,665 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-02-09 00:49:23,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-09 00:49:23,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-09 00:49:23,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-09 00:49:23,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-09 00:49:23,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-09 00:49:23,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-09 00:49:23,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-09 00:49:23,667 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-09 00:49:23,749 INFO L234 CfgBuilder]: Building ICFG [2022-02-09 00:49:23,750 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-09 00:49:24,128 INFO L275 CfgBuilder]: Performing block encoding [2022-02-09 00:49:24,308 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-09 00:49:24,308 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-09 00:49:24,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 12:49:24 BoogieIcfgContainer [2022-02-09 00:49:24,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-09 00:49:24,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-09 00:49:24,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-09 00:49:24,316 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-09 00:49:24,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.02 12:49:23" (1/3) ... [2022-02-09 00:49:24,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7348ce3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.02 12:49:24, skipping insertion in model container [2022-02-09 00:49:24,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 12:49:23" (2/3) ... [2022-02-09 00:49:24,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7348ce3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.02 12:49:24, skipping insertion in model container [2022-02-09 00:49:24,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 12:49:24" (3/3) ... [2022-02-09 00:49:24,319 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-equiv.wvr.c [2022-02-09 00:49:24,325 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-09 00:49:24,325 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-09 00:49:24,325 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-09 00:49:24,325 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-09 00:49:24,392 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,392 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,392 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,392 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,393 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,393 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,394 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,394 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,394 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,394 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,394 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,395 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,395 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,395 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,395 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,395 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,397 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,397 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,397 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,397 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,398 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,398 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,399 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,399 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,399 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,399 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,399 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,399 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,400 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,400 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,400 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,400 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,400 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,400 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,400 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,401 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,401 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,401 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,402 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,402 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,402 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,402 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,403 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,403 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,403 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,403 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,404 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,404 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,404 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,404 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,404 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,405 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,405 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,405 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,405 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,406 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,406 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,406 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,406 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,406 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,406 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,406 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,407 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,407 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,407 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,407 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,408 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,408 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,410 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,410 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,410 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,410 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,410 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,410 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,411 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,411 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,411 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,411 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,411 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,411 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,412 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,412 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,413 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,413 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,414 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,415 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,415 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,416 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,416 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,417 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,417 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,417 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,417 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,417 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,417 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,417 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,418 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,418 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,419 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,419 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,419 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,419 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,419 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,419 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,420 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,420 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,421 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,421 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,421 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,421 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,421 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,421 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,422 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,422 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,422 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,422 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,422 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,422 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,422 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,422 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,422 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,423 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,423 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,423 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,423 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,423 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,423 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,423 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,424 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,424 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,424 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,424 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,424 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,424 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,424 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,424 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,426 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,426 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,427 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,427 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,427 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,427 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,427 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,427 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,428 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,428 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,428 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,429 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,429 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,430 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,431 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,431 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,431 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,431 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,431 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,432 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,432 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,432 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,432 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,432 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,432 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,432 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,432 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,432 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,433 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,433 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,433 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,433 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,433 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,433 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,433 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,434 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,434 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,434 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,434 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,434 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,435 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,435 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,435 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,435 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,435 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,435 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,435 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,435 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,439 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,439 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,439 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,439 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,439 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,440 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,440 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,440 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,440 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,440 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,440 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,440 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,440 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,442 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,443 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,443 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,443 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,443 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,443 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,443 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,443 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,443 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,444 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,444 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,444 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,444 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,444 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,445 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,449 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,449 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,453 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,454 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,454 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,454 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,454 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,454 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,454 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,454 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,454 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,456 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,456 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,456 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,456 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,465 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,465 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,466 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,466 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,466 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,466 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,466 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,466 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,467 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,467 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,467 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,467 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,467 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,467 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,467 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,467 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,467 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,468 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,468 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,468 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,468 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,468 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,468 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,469 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,469 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,469 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,469 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,469 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,469 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,469 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,469 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,469 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,469 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,470 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 00:49:24,475 INFO L148 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2022-02-09 00:49:24,531 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-09 00:49:24,539 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-09 00:49:24,539 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-02-09 00:49:24,554 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 204 places, 205 transitions, 454 flow [2022-02-09 00:49:25,531 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 19453 states, 19452 states have (on average 4.476968949208308) internal successors, (87086), 19452 states have internal predecessors, (87086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:49:25,591 INFO L276 IsEmpty]: Start isEmpty. Operand has 19453 states, 19452 states have (on average 4.476968949208308) internal successors, (87086), 19452 states have internal predecessors, (87086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:49:25,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-02-09 00:49:25,893 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 00:49:25,894 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 00:49:25,895 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-09 00:49:25,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 00:49:25,901 INFO L85 PathProgramCache]: Analyzing trace with hash -843314989, now seen corresponding path program 1 times [2022-02-09 00:49:25,909 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 00:49:25,910 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448113242] [2022-02-09 00:49:25,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 00:49:25,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 00:49:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 00:49:26,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 00:49:26,209 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 00:49:26,209 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448113242] [2022-02-09 00:49:26,210 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448113242] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 00:49:26,210 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 00:49:26,210 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-09 00:49:26,211 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701978530] [2022-02-09 00:49:26,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 00:49:26,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-09 00:49:26,215 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 00:49:26,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-09 00:49:26,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-09 00:49:26,303 INFO L87 Difference]: Start difference. First operand has 19453 states, 19452 states have (on average 4.476968949208308) internal successors, (87086), 19452 states have internal predecessors, (87086), 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, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:49:26,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 00:49:26,704 INFO L93 Difference]: Finished difference Result 19453 states and 81672 transitions. [2022-02-09 00:49:26,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 00:49:26,706 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 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 145 [2022-02-09 00:49:26,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 00:49:27,046 INFO L225 Difference]: With dead ends: 19453 [2022-02-09 00:49:27,047 INFO L226 Difference]: Without dead ends: 19449 [2022-02-09 00:49:27,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-09 00:49:27,052 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-09 00:49:27,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-09 00:49:27,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19449 states. [2022-02-09 00:49:27,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19449 to 19449. [2022-02-09 00:49:28,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19449 states, 19448 states have (on average 4.199300699300699) internal successors, (81668), 19448 states have internal predecessors, (81668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:49:28,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19449 states to 19449 states and 81668 transitions. [2022-02-09 00:49:28,456 INFO L78 Accepts]: Start accepts. Automaton has 19449 states and 81668 transitions. Word has length 145 [2022-02-09 00:49:28,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 00:49:28,456 INFO L470 AbstractCegarLoop]: Abstraction has 19449 states and 81668 transitions. [2022-02-09 00:49:28,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:49:28,457 INFO L276 IsEmpty]: Start isEmpty. Operand 19449 states and 81668 transitions. [2022-02-09 00:49:28,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-02-09 00:49:28,561 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 00:49:28,561 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 00:49:28,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-09 00:49:28,562 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-09 00:49:28,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 00:49:28,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1289762845, now seen corresponding path program 1 times [2022-02-09 00:49:28,563 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 00:49:28,563 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156953329] [2022-02-09 00:49:28,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 00:49:28,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 00:49:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 00:49:28,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 00:49:28,791 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 00:49:28,791 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156953329] [2022-02-09 00:49:28,792 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156953329] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 00:49:28,792 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 00:49:28,792 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-09 00:49:28,792 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426663281] [2022-02-09 00:49:28,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 00:49:28,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 00:49:28,793 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 00:49:28,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 00:49:28,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-09 00:49:28,795 INFO L87 Difference]: Start difference. First operand 19449 states and 81668 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:49:29,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 00:49:29,792 INFO L93 Difference]: Finished difference Result 49650 states and 212030 transitions. [2022-02-09 00:49:29,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 00:49:29,794 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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 148 [2022-02-09 00:49:29,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 00:49:30,419 INFO L225 Difference]: With dead ends: 49650 [2022-02-09 00:49:30,420 INFO L226 Difference]: Without dead ends: 47169 [2022-02-09 00:49:30,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-09 00:49:30,421 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 162 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-09 00:49:30,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 868 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-09 00:49:30,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47169 states. [2022-02-09 00:49:31,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47169 to 22104. [2022-02-09 00:49:31,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22104 states, 22103 states have (on average 4.187621589829435) internal successors, (92559), 22103 states have internal predecessors, (92559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:49:31,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22104 states to 22104 states and 92559 transitions. [2022-02-09 00:49:31,910 INFO L78 Accepts]: Start accepts. Automaton has 22104 states and 92559 transitions. Word has length 148 [2022-02-09 00:49:31,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 00:49:31,914 INFO L470 AbstractCegarLoop]: Abstraction has 22104 states and 92559 transitions. [2022-02-09 00:49:31,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:49:31,914 INFO L276 IsEmpty]: Start isEmpty. Operand 22104 states and 92559 transitions. [2022-02-09 00:49:32,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-02-09 00:49:32,256 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 00:49:32,256 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 00:49:32,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-09 00:49:32,257 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-09 00:49:32,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 00:49:32,258 INFO L85 PathProgramCache]: Analyzing trace with hash -2143634427, now seen corresponding path program 2 times [2022-02-09 00:49:32,258 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 00:49:32,258 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395884508] [2022-02-09 00:49:32,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 00:49:32,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 00:49:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 00:49:32,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 00:49:32,455 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 00:49:32,455 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395884508] [2022-02-09 00:49:32,455 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395884508] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 00:49:32,456 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 00:49:32,456 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-09 00:49:32,456 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757041770] [2022-02-09 00:49:32,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 00:49:32,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 00:49:32,457 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 00:49:32,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 00:49:32,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-09 00:49:32,458 INFO L87 Difference]: Start difference. First operand 22104 states and 92559 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:49:33,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 00:49:33,404 INFO L93 Difference]: Finished difference Result 56186 states and 238313 transitions. [2022-02-09 00:49:33,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 00:49:33,404 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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 148 [2022-02-09 00:49:33,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 00:49:33,857 INFO L225 Difference]: With dead ends: 56186 [2022-02-09 00:49:33,857 INFO L226 Difference]: Without dead ends: 53705 [2022-02-09 00:49:33,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-09 00:49:33,858 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 125 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-09 00:49:33,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 863 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-09 00:49:33,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53705 states. [2022-02-09 00:49:35,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53705 to 24167. [2022-02-09 00:49:35,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24167 states, 24166 states have (on average 4.15596292311512) internal successors, (100433), 24166 states have internal predecessors, (100433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:49:35,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24167 states to 24167 states and 100433 transitions. [2022-02-09 00:49:35,261 INFO L78 Accepts]: Start accepts. Automaton has 24167 states and 100433 transitions. Word has length 148 [2022-02-09 00:49:35,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 00:49:35,262 INFO L470 AbstractCegarLoop]: Abstraction has 24167 states and 100433 transitions. [2022-02-09 00:49:35,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:49:35,262 INFO L276 IsEmpty]: Start isEmpty. Operand 24167 states and 100433 transitions. [2022-02-09 00:49:35,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-02-09 00:49:35,318 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 00:49:35,318 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 00:49:35,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-09 00:49:35,318 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-09 00:49:35,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 00:49:35,319 INFO L85 PathProgramCache]: Analyzing trace with hash 299986776, now seen corresponding path program 1 times [2022-02-09 00:49:35,319 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 00:49:35,319 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082456371] [2022-02-09 00:49:35,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 00:49:35,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 00:49:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 00:49:35,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 00:49:35,505 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 00:49:35,505 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082456371] [2022-02-09 00:49:35,505 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082456371] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 00:49:35,505 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 00:49:35,505 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-09 00:49:35,505 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359010143] [2022-02-09 00:49:35,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 00:49:35,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-09 00:49:35,506 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 00:49:35,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-09 00:49:35,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-09 00:49:35,506 INFO L87 Difference]: Start difference. First operand 24167 states and 100433 transitions. Second operand has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:49:36,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 00:49:36,162 INFO L93 Difference]: Finished difference Result 46408 states and 191388 transitions. [2022-02-09 00:49:36,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-09 00:49:36,163 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 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 152 [2022-02-09 00:49:36,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 00:49:36,546 INFO L225 Difference]: With dead ends: 46408 [2022-02-09 00:49:36,547 INFO L226 Difference]: Without dead ends: 41314 [2022-02-09 00:49:36,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-02-09 00:49:36,549 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 616 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-09 00:49:36,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [616 Valid, 551 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-09 00:49:36,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41314 states. [2022-02-09 00:49:37,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41314 to 31225. [2022-02-09 00:49:37,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31225 states, 31224 states have (on average 4.112477581347681) internal successors, (128408), 31224 states have internal predecessors, (128408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:49:37,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31225 states to 31225 states and 128408 transitions. [2022-02-09 00:49:37,889 INFO L78 Accepts]: Start accepts. Automaton has 31225 states and 128408 transitions. Word has length 152 [2022-02-09 00:49:37,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 00:49:37,890 INFO L470 AbstractCegarLoop]: Abstraction has 31225 states and 128408 transitions. [2022-02-09 00:49:37,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:49:37,891 INFO L276 IsEmpty]: Start isEmpty. Operand 31225 states and 128408 transitions. [2022-02-09 00:49:38,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-02-09 00:49:38,052 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 00:49:38,052 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 00:49:38,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-09 00:49:38,053 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-09 00:49:38,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 00:49:38,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1629900824, now seen corresponding path program 1 times [2022-02-09 00:49:38,053 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 00:49:38,053 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78690498] [2022-02-09 00:49:38,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 00:49:38,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 00:49:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 00:49:38,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 00:49:38,230 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 00:49:38,230 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78690498] [2022-02-09 00:49:38,230 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78690498] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 00:49:38,230 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 00:49:38,230 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-09 00:49:38,230 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344288214] [2022-02-09 00:49:38,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 00:49:38,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-09 00:49:38,231 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 00:49:38,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-09 00:49:38,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-09 00:49:38,232 INFO L87 Difference]: Start difference. First operand 31225 states and 128408 transitions. Second operand has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:49:38,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 00:49:38,627 INFO L93 Difference]: Finished difference Result 31662 states and 126747 transitions. [2022-02-09 00:49:38,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-09 00:49:38,628 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 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 152 [2022-02-09 00:49:38,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 00:49:39,097 INFO L225 Difference]: With dead ends: 31662 [2022-02-09 00:49:39,097 INFO L226 Difference]: Without dead ends: 20789 [2022-02-09 00:49:39,097 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-02-09 00:49:39,098 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 517 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-09 00:49:39,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [517 Valid, 645 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-09 00:49:39,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20789 states. [2022-02-09 00:49:39,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20789 to 20784. [2022-02-09 00:49:39,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20784 states, 20783 states have (on average 4.053264687484964) internal successors, (84239), 20783 states have internal predecessors, (84239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:49:39,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20784 states to 20784 states and 84239 transitions. [2022-02-09 00:49:39,770 INFO L78 Accepts]: Start accepts. Automaton has 20784 states and 84239 transitions. Word has length 152 [2022-02-09 00:49:39,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 00:49:39,770 INFO L470 AbstractCegarLoop]: Abstraction has 20784 states and 84239 transitions. [2022-02-09 00:49:39,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:49:39,771 INFO L276 IsEmpty]: Start isEmpty. Operand 20784 states and 84239 transitions. [2022-02-09 00:49:39,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-02-09 00:49:39,820 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 00:49:39,820 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 00:49:39,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-09 00:49:39,820 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-09 00:49:39,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 00:49:39,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1565738794, now seen corresponding path program 1 times [2022-02-09 00:49:39,821 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 00:49:39,821 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050903953] [2022-02-09 00:49:39,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 00:49:39,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 00:49:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 00:49:39,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 00:49:39,930 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 00:49:39,930 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050903953] [2022-02-09 00:49:39,930 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050903953] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 00:49:39,930 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030718112] [2022-02-09 00:49:39,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 00:49:39,931 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 00:49:39,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 00:49:39,933 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 00:49:39,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-09 00:49:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 00:49:40,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-09 00:49:40,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 00:49:40,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 00:49:40,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 00:49:41,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 00:49:41,030 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030718112] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 00:49:41,031 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 00:49:41,031 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-02-09 00:49:41,031 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843944771] [2022-02-09 00:49:41,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 00:49:41,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-09 00:49:41,032 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 00:49:41,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-09 00:49:41,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2022-02-09 00:49:41,033 INFO L87 Difference]: Start difference. First operand 20784 states and 84239 transitions. Second operand has 18 states, 18 states have (on average 11.11111111111111) internal successors, (200), 18 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:49:41,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 00:49:41,912 INFO L93 Difference]: Finished difference Result 39863 states and 160291 transitions. [2022-02-09 00:49:41,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-09 00:49:41,913 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 11.11111111111111) internal successors, (200), 18 states have internal predecessors, (200), 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 159 [2022-02-09 00:49:41,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 00:49:42,040 INFO L225 Difference]: With dead ends: 39863 [2022-02-09 00:49:42,040 INFO L226 Difference]: Without dead ends: 34571 [2022-02-09 00:49:42,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2022-02-09 00:49:42,042 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 889 mSDsluCounter, 1914 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 1842 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-09 00:49:42,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [889 Valid, 1842 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-09 00:49:42,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34571 states. [2022-02-09 00:49:42,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34571 to 26462. [2022-02-09 00:49:42,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26462 states, 26461 states have (on average 4.016930577075696) internal successors, (106292), 26461 states have internal predecessors, (106292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:49:43,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26462 states to 26462 states and 106292 transitions. [2022-02-09 00:49:43,157 INFO L78 Accepts]: Start accepts. Automaton has 26462 states and 106292 transitions. Word has length 159 [2022-02-09 00:49:43,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 00:49:43,157 INFO L470 AbstractCegarLoop]: Abstraction has 26462 states and 106292 transitions. [2022-02-09 00:49:43,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 11.11111111111111) internal successors, (200), 18 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:49:43,157 INFO L276 IsEmpty]: Start isEmpty. Operand 26462 states and 106292 transitions. [2022-02-09 00:49:43,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-02-09 00:49:43,233 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 00:49:43,233 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 00:49:43,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-09 00:49:43,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-02-09 00:49:43,438 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-09 00:49:43,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 00:49:43,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1684428250, now seen corresponding path program 1 times [2022-02-09 00:49:43,438 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 00:49:43,438 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862433371] [2022-02-09 00:49:43,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 00:49:43,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 00:49:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 00:49:43,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 00:49:43,576 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 00:49:43,576 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862433371] [2022-02-09 00:49:43,576 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862433371] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 00:49:43,578 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063169396] [2022-02-09 00:49:43,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 00:49:43,578 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 00:49:43,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 00:49:43,580 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 00:49:43,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-09 00:49:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 00:49:43,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-09 00:49:43,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 00:49:44,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 00:49:44,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 00:49:44,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 00:49:44,470 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063169396] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 00:49:44,471 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 00:49:44,471 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-02-09 00:49:44,471 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212897057] [2022-02-09 00:49:44,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 00:49:44,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-09 00:49:44,472 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 00:49:44,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-09 00:49:44,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2022-02-09 00:49:44,472 INFO L87 Difference]: Start difference. First operand 26462 states and 106292 transitions. Second operand has 18 states, 18 states have (on average 11.944444444444445) internal successors, (215), 18 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:49:44,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 00:49:44,934 INFO L93 Difference]: Finished difference Result 24919 states and 99000 transitions. [2022-02-09 00:49:44,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-09 00:49:44,935 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 11.944444444444445) internal successors, (215), 18 states have internal predecessors, (215), 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 159 [2022-02-09 00:49:44,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 00:49:45,261 INFO L225 Difference]: With dead ends: 24919 [2022-02-09 00:49:45,261 INFO L226 Difference]: Without dead ends: 20796 [2022-02-09 00:49:45,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2022-02-09 00:49:45,262 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 697 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-09 00:49:45,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [697 Valid, 1225 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-09 00:49:45,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20796 states. [2022-02-09 00:49:45,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20796 to 20791. [2022-02-09 00:49:45,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20791 states, 20790 states have (on average 4.052236652236652) internal successors, (84246), 20790 states have internal predecessors, (84246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:49:46,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20791 states to 20791 states and 84246 transitions. [2022-02-09 00:49:46,047 INFO L78 Accepts]: Start accepts. Automaton has 20791 states and 84246 transitions. Word has length 159 [2022-02-09 00:49:46,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 00:49:46,048 INFO L470 AbstractCegarLoop]: Abstraction has 20791 states and 84246 transitions. [2022-02-09 00:49:46,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 11.944444444444445) internal successors, (215), 18 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:49:46,048 INFO L276 IsEmpty]: Start isEmpty. Operand 20791 states and 84246 transitions. [2022-02-09 00:49:46,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-02-09 00:49:46,095 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 00:49:46,096 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 00:49:46,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-09 00:49:46,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-02-09 00:49:46,317 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-09 00:49:46,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 00:49:46,317 INFO L85 PathProgramCache]: Analyzing trace with hash -31365736, now seen corresponding path program 2 times [2022-02-09 00:49:46,317 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 00:49:46,317 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361075460] [2022-02-09 00:49:46,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 00:49:46,318 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 00:49:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 00:49:46,470 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 00:49:46,470 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 00:49:46,470 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361075460] [2022-02-09 00:49:46,470 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361075460] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 00:49:46,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499791957] [2022-02-09 00:49:46,471 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-09 00:49:46,471 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 00:49:46,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 00:49:46,472 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 00:49:46,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-09 00:49:46,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-09 00:49:46,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 00:49:46,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-09 00:49:46,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 00:49:47,002 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 00:49:47,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 00:49:47,379 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 00:49:47,379 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499791957] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-09 00:49:47,379 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-09 00:49:47,379 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 18 [2022-02-09 00:49:47,379 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108133993] [2022-02-09 00:49:47,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 00:49:47,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-09 00:49:47,380 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 00:49:47,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-09 00:49:47,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-02-09 00:49:47,381 INFO L87 Difference]: Start difference. First operand 20791 states and 84246 transitions. Second operand has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:49:47,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 00:49:47,730 INFO L93 Difference]: Finished difference Result 24097 states and 99434 transitions. [2022-02-09 00:49:47,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-09 00:49:47,730 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 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 166 [2022-02-09 00:49:47,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 00:49:48,036 INFO L225 Difference]: With dead ends: 24097 [2022-02-09 00:49:48,037 INFO L226 Difference]: Without dead ends: 23297 [2022-02-09 00:49:48,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 322 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2022-02-09 00:49:48,037 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 431 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-09 00:49:48,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [431 Valid, 539 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-09 00:49:48,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23297 states. [2022-02-09 00:49:48,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23297 to 18721. [2022-02-09 00:49:48,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18721 states, 18720 states have (on average 4.096581196581196) internal successors, (76688), 18720 states have internal predecessors, (76688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:49:48,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18721 states to 18721 states and 76688 transitions. [2022-02-09 00:49:48,648 INFO L78 Accepts]: Start accepts. Automaton has 18721 states and 76688 transitions. Word has length 166 [2022-02-09 00:49:48,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 00:49:48,650 INFO L470 AbstractCegarLoop]: Abstraction has 18721 states and 76688 transitions. [2022-02-09 00:49:48,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:49:48,650 INFO L276 IsEmpty]: Start isEmpty. Operand 18721 states and 76688 transitions. [2022-02-09 00:49:48,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-02-09 00:49:48,702 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 00:49:48,702 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 00:49:48,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-09 00:49:48,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 00:49:48,926 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-09 00:49:48,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 00:49:48,927 INFO L85 PathProgramCache]: Analyzing trace with hash -150055192, now seen corresponding path program 2 times [2022-02-09 00:49:48,927 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 00:49:48,927 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141287307] [2022-02-09 00:49:48,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 00:49:48,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 00:49:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 00:49:49,066 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 00:49:49,067 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 00:49:49,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141287307] [2022-02-09 00:49:49,067 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141287307] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 00:49:49,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233516861] [2022-02-09 00:49:49,067 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-09 00:49:49,067 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 00:49:49,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 00:49:49,069 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 00:49:49,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-09 00:49:49,202 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-09 00:49:49,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 00:49:49,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-09 00:49:49,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 00:49:49,634 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 00:49:49,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 00:49:49,966 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-09 00:49:49,966 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233516861] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-09 00:49:49,966 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-09 00:49:49,967 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 19 [2022-02-09 00:49:49,967 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880281393] [2022-02-09 00:49:49,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 00:49:49,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-09 00:49:49,967 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 00:49:49,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-09 00:49:49,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-02-09 00:49:49,968 INFO L87 Difference]: Start difference. First operand 18721 states and 76688 transitions. Second operand has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:49:50,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 00:49:50,354 INFO L93 Difference]: Finished difference Result 26816 states and 110778 transitions. [2022-02-09 00:49:50,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-09 00:49:50,354 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 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 166 [2022-02-09 00:49:50,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 00:49:50,727 INFO L225 Difference]: With dead ends: 26816 [2022-02-09 00:49:50,727 INFO L226 Difference]: Without dead ends: 23578 [2022-02-09 00:49:50,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 320 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-02-09 00:49:50,730 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 313 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-09 00:49:50,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 579 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-09 00:49:50,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23578 states. [2022-02-09 00:49:51,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23578 to 20340. [2022-02-09 00:49:51,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20340 states, 20339 states have (on average 4.105708245243129) internal successors, (83506), 20339 states have internal predecessors, (83506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:49:51,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20340 states to 20340 states and 83506 transitions. [2022-02-09 00:49:51,496 INFO L78 Accepts]: Start accepts. Automaton has 20340 states and 83506 transitions. Word has length 166 [2022-02-09 00:49:51,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 00:49:51,497 INFO L470 AbstractCegarLoop]: Abstraction has 20340 states and 83506 transitions. [2022-02-09 00:49:51,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:49:51,497 INFO L276 IsEmpty]: Start isEmpty. Operand 20340 states and 83506 transitions. [2022-02-09 00:49:51,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-09 00:49:51,559 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 00:49:51,560 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 00:49:51,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-09 00:49:51,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 00:49:51,785 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-09 00:49:51,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 00:49:51,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1267312477, now seen corresponding path program 1 times [2022-02-09 00:49:51,786 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 00:49:51,786 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716304555] [2022-02-09 00:49:51,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 00:49:51,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 00:49:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 00:49:52,348 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-09 00:49:52,348 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 00:49:52,348 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716304555] [2022-02-09 00:49:52,348 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716304555] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 00:49:52,348 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776534237] [2022-02-09 00:49:52,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 00:49:52,349 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 00:49:52,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 00:49:52,350 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 00:49:52,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-09 00:49:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 00:49:52,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 70 conjunts are in the unsatisfiable core [2022-02-09 00:49:52,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 00:49:53,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 00:49:53,179 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-02-09 00:49:53,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 00:49:53,296 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-02-09 00:49:53,431 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-02-09 00:49:53,642 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-09 00:49:53,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 00:49:53,914 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_334 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_334 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1)))) is different from false [2022-02-09 00:49:53,974 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1)))) is different from false [2022-02-09 00:49:54,014 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1)))) is different from false [2022-02-09 00:49:54,061 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_26| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_26|)) (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |v_thread1Thread1of1ForFork3_~#t3~0.base_26| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |v_thread1Thread1of1ForFork3_~#t3~0.base_26| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1)))))) is different from false [2022-02-09 00:49:54,097 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_26| Int)) (or (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |v_thread1Thread1of1ForFork3_~#t3~0.base_26| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |v_thread1Thread1of1ForFork3_~#t3~0.base_26| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 c_~t_8~0 1)))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_26|)))) is different from false [2022-02-09 00:49:54,117 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 00:49:54,118 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 331 treesize of output 221 [2022-02-09 00:49:54,124 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 201 [2022-02-09 00:49:54,129 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 193 [2022-02-09 00:49:54,136 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 177 [2022-02-09 00:49:54,143 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 169 [2022-02-09 00:49:54,786 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-09 00:49:54,787 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776534237] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 00:49:54,787 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 00:49:54,787 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 19] total 42 [2022-02-09 00:49:54,787 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379127607] [2022-02-09 00:49:54,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 00:49:54,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-02-09 00:49:54,788 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 00:49:54,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-02-09 00:49:54,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1203, Unknown=5, NotChecked=370, Total=1722 [2022-02-09 00:49:54,789 INFO L87 Difference]: Start difference. First operand 20340 states and 83506 transitions. Second operand has 42 states, 42 states have (on average 6.166666666666667) internal successors, (259), 42 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:49:57,346 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~X_0~0.base)) (.cse0 (+ c_~X_0~0.offset (* 4 c_~i_7~0)))) (and (= .cse0 4) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (= c_~s_6~0 0) (not (= c_~X_0~0.base |c_thread1Thread1of1ForFork3_~#t2~0.base|)) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t2~0.base|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_26| Int)) (or (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |v_thread1Thread1of1ForFork3_~#t3~0.base_26| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |v_thread1Thread1of1ForFork3_~#t3~0.base_26| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 c_~t_8~0 1)))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_26|)))) (= c_~X_0~0.offset 0) (= (select .cse1 (+ c_~X_0~0.offset 4)) c_~t_8~0) (= (select .cse1 .cse0) c_~t_8~0))) is different from false [2022-02-09 00:49:59,381 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~X_0~0.base)) (.cse0 (+ c_~X_0~0.offset (* 4 c_~i_7~0)))) (let ((.cse1 (select .cse2 .cse0))) (and (= .cse0 4) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= .cse1 c_~s_6~0) (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_26| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_26|)) (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |v_thread1Thread1of1ForFork3_~#t3~0.base_26| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |v_thread1Thread1of1ForFork3_~#t3~0.base_26| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1)))))) (= (+ c_~s_6~0 (* (- 1) (select .cse2 (+ c_~X_0~0.offset 4)))) 0) (<= c_~s_6~0 .cse1) (not (= c_~X_0~0.base |c_thread1Thread1of1ForFork3_~#t2~0.base|)) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t2~0.base|) (= c_~X_0~0.offset 0)))) is different from false [2022-02-09 00:51:01,724 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~X_0~0.base)) (.cse0 (+ c_~X_0~0.offset (* 4 c_~i_7~0)))) (let ((.cse1 (select .cse2 .cse0))) (and (= .cse0 4) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_#StackHeapBarrier|) (<= .cse1 c_~s_6~0) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_26| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_26|)) (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |v_thread1Thread1of1ForFork3_~#t3~0.base_26| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |v_thread1Thread1of1ForFork3_~#t3~0.base_26| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1)))))) (= (+ c_~s_6~0 (* (- 1) (select .cse2 (+ c_~X_0~0.offset 4)))) 0) (<= c_~s_6~0 .cse1) (not (= c_~X_0~0.base |c_thread1Thread1of1ForFork3_~#t2~0.base|)) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t2~0.base|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= c_~X_0~0.offset 0)))) is different from false [2022-02-09 00:51:04,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 00:51:04,628 INFO L93 Difference]: Finished difference Result 104062 states and 440793 transitions. [2022-02-09 00:51:04,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-02-09 00:51:04,629 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 6.166666666666667) internal successors, (259), 42 states have internal predecessors, (259), 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 170 [2022-02-09 00:51:04,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 00:51:05,209 INFO L225 Difference]: With dead ends: 104062 [2022-02-09 00:51:05,210 INFO L226 Difference]: Without dead ends: 103081 [2022-02-09 00:51:05,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 316 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 67.7s TimeCoverageRelationStatistics Valid=403, Invalid=3253, Unknown=36, NotChecked=1000, Total=4692 [2022-02-09 00:51:05,211 INFO L933 BasicCegarLoop]: 337 mSDtfsCounter, 1646 mSDsluCounter, 7225 mSDsCounter, 0 mSdLazyCounter, 3522 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1646 SdHoareTripleChecker+Valid, 6444 SdHoareTripleChecker+Invalid, 7366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 3522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3778 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-09 00:51:05,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1646 Valid, 6444 Invalid, 7366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 3522 Invalid, 0 Unknown, 3778 Unchecked, 1.7s Time] [2022-02-09 00:51:05,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103081 states. [2022-02-09 00:51:06,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103081 to 26098. [2022-02-09 00:51:07,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26098 states, 26097 states have (on average 4.16772042763536) internal successors, (108765), 26097 states have internal predecessors, (108765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:51:07,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26098 states to 26098 states and 108765 transitions. [2022-02-09 00:51:07,111 INFO L78 Accepts]: Start accepts. Automaton has 26098 states and 108765 transitions. Word has length 170 [2022-02-09 00:51:07,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 00:51:07,111 INFO L470 AbstractCegarLoop]: Abstraction has 26098 states and 108765 transitions. [2022-02-09 00:51:07,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 6.166666666666667) internal successors, (259), 42 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:51:07,111 INFO L276 IsEmpty]: Start isEmpty. Operand 26098 states and 108765 transitions. [2022-02-09 00:51:07,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-09 00:51:07,452 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 00:51:07,452 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 00:51:07,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-09 00:51:07,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-09 00:51:07,654 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-09 00:51:07,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 00:51:07,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1098652227, now seen corresponding path program 1 times [2022-02-09 00:51:07,654 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 00:51:07,654 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556617848] [2022-02-09 00:51:07,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 00:51:07,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 00:51:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 00:51:08,112 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-09 00:51:08,112 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 00:51:08,112 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556617848] [2022-02-09 00:51:08,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556617848] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 00:51:08,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777085369] [2022-02-09 00:51:08,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 00:51:08,113 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 00:51:08,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 00:51:08,120 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 00:51:08,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-09 00:51:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 00:51:08,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 58 conjunts are in the unsatisfiable core [2022-02-09 00:51:08,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 00:51:08,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 00:51:08,732 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-02-09 00:51:08,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 00:51:08,833 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-02-09 00:51:08,894 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-02-09 00:51:09,120 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-09 00:51:09,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 00:51:09,348 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_384 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1))) (forall ((v_ArrVal_384 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0)))) is different from false [2022-02-09 00:51:09,412 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1))) (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0)))) is different from false [2022-02-09 00:51:09,449 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) is different from false [2022-02-09 00:51:09,477 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_29| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_29|)) (and (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |v_thread1Thread1of1ForFork3_~#t3~0.base_29| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |v_thread1Thread1of1ForFork3_~#t3~0.base_29| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))))) is different from false [2022-02-09 00:51:09,506 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_29| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_29|)) (and (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |v_thread1Thread1of1ForFork3_~#t3~0.base_29| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |v_thread1Thread1of1ForFork3_~#t3~0.base_29| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))))) is different from false [2022-02-09 00:51:09,528 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 00:51:09,529 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 445 treesize of output 293 [2022-02-09 00:51:09,535 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 277 treesize of output 269 [2022-02-09 00:51:09,540 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 269 treesize of output 261 [2022-02-09 00:51:09,545 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 261 treesize of output 245 [2022-02-09 00:51:09,552 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 245 treesize of output 229 [2022-02-09 00:51:10,029 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-09 00:51:10,029 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777085369] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 00:51:10,029 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 00:51:10,029 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 44 [2022-02-09 00:51:10,030 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565469228] [2022-02-09 00:51:10,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 00:51:10,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-02-09 00:51:10,031 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 00:51:10,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-02-09 00:51:10,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1346, Unknown=5, NotChecked=390, Total=1892 [2022-02-09 00:51:10,032 INFO L87 Difference]: Start difference. First operand 26098 states and 108765 transitions. Second operand has 44 states, 44 states have (on average 6.090909090909091) internal successors, (268), 44 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:51:12,644 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~X_0~0.base)) (.cse0 (+ c_~X_0~0.offset (* 4 c_~i_7~0)))) (and (= .cse0 4) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (= c_~s_6~0 0) (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_29| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_29|)) (and (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |v_thread1Thread1of1ForFork3_~#t3~0.base_29| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |v_thread1Thread1of1ForFork3_~#t3~0.base_29| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))))) (not (= c_~X_0~0.base |c_thread1Thread1of1ForFork3_~#t2~0.base|)) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t2~0.base|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= c_~X_0~0.offset 0) (= (select .cse1 (+ c_~X_0~0.offset 4)) c_~t_8~0) (= (select .cse1 .cse0) c_~t_8~0))) is different from false [2022-02-09 00:51:14,685 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~X_0~0.base)) (.cse0 (+ c_~X_0~0.offset (* 4 c_~i_7~0)))) (let ((.cse1 (select .cse2 .cse0))) (and (= .cse0 4) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= .cse1 c_~s_6~0) (= (+ c_~s_6~0 (* (- 1) (select .cse2 (+ c_~X_0~0.offset 4)))) 0) (<= c_~s_6~0 .cse1) (not (= c_~X_0~0.base |c_thread1Thread1of1ForFork3_~#t2~0.base|)) (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_29| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_29|)) (and (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |v_thread1Thread1of1ForFork3_~#t3~0.base_29| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |v_thread1Thread1of1ForFork3_~#t3~0.base_29| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))))) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t2~0.base|) (= c_~X_0~0.offset 0)))) is different from false [2022-02-09 00:51:16,773 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~X_0~0.base)) (.cse0 (+ c_~X_0~0.offset (* 4 c_~i_7~0)))) (and (= .cse0 4) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (= c_~s_6~0 0) (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_29| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_29|)) (and (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |v_thread1Thread1of1ForFork3_~#t3~0.base_29| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |v_thread1Thread1of1ForFork3_~#t3~0.base_29| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))))) (not (= c_~X_0~0.base |c_thread1Thread1of1ForFork3_~#t2~0.base|)) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (<= c_~s_6~0 c_~s_2~0) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t2~0.base|) (< c_~s_2~0 (+ c_~s_6~0 1)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= c_~X_0~0.offset 0) (= (select .cse1 (+ c_~X_0~0.offset 4)) c_~t_8~0) (= (select .cse1 .cse0) c_~t_8~0))) is different from false [2022-02-09 00:51:18,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-09 00:51:18,632 INFO L93 Difference]: Finished difference Result 91851 states and 388677 transitions. [2022-02-09 00:51:18,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-09 00:51:18,632 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 6.090909090909091) internal successors, (268), 44 states have internal predecessors, (268), 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 170 [2022-02-09 00:51:18,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-09 00:51:19,368 INFO L225 Difference]: With dead ends: 91851 [2022-02-09 00:51:19,368 INFO L226 Difference]: Without dead ends: 88530 [2022-02-09 00:51:19,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 316 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=354, Invalid=2976, Unknown=8, NotChecked=952, Total=4290 [2022-02-09 00:51:19,370 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 1373 mSDsluCounter, 6436 mSDsCounter, 0 mSdLazyCounter, 2219 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1373 SdHoareTripleChecker+Valid, 5695 SdHoareTripleChecker+Invalid, 6746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4481 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-09 00:51:19,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1373 Valid, 5695 Invalid, 6746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2219 Invalid, 0 Unknown, 4481 Unchecked, 1.0s Time] [2022-02-09 00:51:19,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88530 states. [2022-02-09 00:51:20,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88530 to 27592. [2022-02-09 00:51:20,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27592 states, 27591 states have (on average 4.172809974266971) internal successors, (115132), 27591 states have internal predecessors, (115132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:51:21,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27592 states to 27592 states and 115132 transitions. [2022-02-09 00:51:21,021 INFO L78 Accepts]: Start accepts. Automaton has 27592 states and 115132 transitions. Word has length 170 [2022-02-09 00:51:21,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-09 00:51:21,023 INFO L470 AbstractCegarLoop]: Abstraction has 27592 states and 115132 transitions. [2022-02-09 00:51:21,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 6.090909090909091) internal successors, (268), 44 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 00:51:21,024 INFO L276 IsEmpty]: Start isEmpty. Operand 27592 states and 115132 transitions. [2022-02-09 00:51:21,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-02-09 00:51:21,119 INFO L506 BasicCegarLoop]: Found error trace [2022-02-09 00:51:21,119 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 00:51:21,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-09 00:51:21,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 00:51:21,320 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-09 00:51:21,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 00:51:21,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1061992675, now seen corresponding path program 2 times [2022-02-09 00:51:21,321 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 00:51:21,321 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896030871] [2022-02-09 00:51:21,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 00:51:21,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 00:51:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 00:51:21,739 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-09 00:51:21,740 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 00:51:21,740 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896030871] [2022-02-09 00:51:21,740 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896030871] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 00:51:21,740 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500584670] [2022-02-09 00:51:21,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-09 00:51:21,740 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 00:51:21,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 00:51:21,741 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 00:51:21,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-09 00:51:21,864 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-09 00:51:21,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 00:51:21,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 92 conjunts are in the unsatisfiable core [2022-02-09 00:51:21,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 00:51:21,925 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 00:51:22,166 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-09 00:51:22,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-02-09 00:51:22,480 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-09 00:51:22,827 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 00:51:22,900 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-02-09 00:51:22,900 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-02-09 00:51:22,942 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-09 00:51:23,459 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-02-09 00:51:23,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 00:51:23,542 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-02-09 00:51:23,628 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-02-09 00:51:23,760 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 00:51:23,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 00:51:23,982 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_440 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_440 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1)))) is different from false [2022-02-09 00:51:24,028 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1)))) is different from false [2022-02-09 00:51:24,052 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) is different from false [2022-02-09 00:51:24,078 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_32| Int)) (or (and (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |v_thread1Thread1of1ForFork3_~#t3~0.base_32| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |v_thread1Thread1of1ForFork3_~#t3~0.base_32| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1)))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_32|)))) is different from false [2022-02-09 00:51:24,226 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_32| Int)) (or (and (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |v_thread1Thread1of1ForFork3_~#t3~0.base_32| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |v_thread1Thread1of1ForFork3_~#t3~0.base_32| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_32|)))) is different from false [2022-02-09 00:51:24,257 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_32| Int)) (or (and (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |v_thread1Thread1of1ForFork3_~#t3~0.base_32| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))) 1))) (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (<= (+ c_~s_6~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |v_thread1Thread1of1ForFork3_~#t3~0.base_32| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_32|)))) is different from false [2022-02-09 00:51:24,333 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_32| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_32|)) (and (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (let ((.cse0 (+ c_~X_0~0.offset 4))) (<= (select (select |c_#memory_int| c_~X_0~0.base) .cse0) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |v_thread1Thread1of1ForFork3_~#t3~0.base_32| v_ArrVal_440) c_~X_0~0.base) .cse0)))) (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (let ((.cse1 (+ c_~X_0~0.offset 4))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |v_thread1Thread1of1ForFork3_~#t3~0.base_32| v_ArrVal_440) c_~X_0~0.base) .cse1) (+ (select (select |c_#memory_int| c_~X_0~0.base) .cse1) 1))))))) is different from false [2022-02-09 00:51:24,475 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_32| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_32|)) (and (forall ((v_ArrVal_438 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_438)) (.cse1 (+ c_~X_0~0.offset 4))) (< (select (select (store (store .cse0 |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |v_thread1Thread1of1ForFork3_~#t3~0.base_32| v_ArrVal_440) c_~X_0~0.base) .cse1) (+ (select (select .cse0 c_~X_0~0.base) .cse1) 1)))) (forall ((v_ArrVal_438 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_438)) (.cse3 (+ c_~X_0~0.offset 4))) (<= (select (select .cse2 c_~X_0~0.base) .cse3) (select (select (store (store .cse2 |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |v_thread1Thread1of1ForFork3_~#t3~0.base_32| v_ArrVal_440) c_~X_0~0.base) .cse3))))))) is different from false [2022-02-09 00:51:38,337 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 00:51:38,338 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 82 [2022-02-09 00:51:38,357 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 00:51:38,358 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13306 treesize of output 12232 [2022-02-09 00:51:38,889 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11941 treesize of output 11685 [2022-02-09 00:51:38,930 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11685 treesize of output 11557 [2022-02-09 00:51:38,972 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11557 treesize of output 10533 [2022-02-09 00:51:39,012 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10533 treesize of output 10021 [2022-02-09 00:51:39,061 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10021 treesize of output 9445 [2022-02-09 00:51:39,119 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9445 treesize of output 9301 [2022-02-09 00:51:39,175 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9301 treesize of output 8277 [2022-02-09 00:51:39,230 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8277 treesize of output 8021 [2022-02-09 00:51:39,281 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-09 00:51:39,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-02-09 00:51:39,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 00:51:39,507 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-09 00:51:39,510 INFO L158 Benchmark]: Toolchain (without parser) took 136321.91ms. Allocated memory was 184.5MB in the beginning and 7.1GB in the end (delta: 6.9GB). Free memory was 133.7MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. [2022-02-09 00:51:39,511 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 184.5MB. Free memory is still 150.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-09 00:51:39,511 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.96ms. Allocated memory was 184.5MB in the beginning and 240.1MB in the end (delta: 55.6MB). Free memory was 133.5MB in the beginning and 215.6MB in the end (delta: -82.1MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. [2022-02-09 00:51:39,511 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.28ms. Allocated memory is still 240.1MB. Free memory was 215.6MB in the beginning and 213.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-02-09 00:51:39,511 INFO L158 Benchmark]: Boogie Preprocessor took 28.14ms. Allocated memory is still 240.1MB. Free memory was 213.0MB in the beginning and 211.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-09 00:51:39,511 INFO L158 Benchmark]: RCFGBuilder took 712.67ms. Allocated memory is still 240.1MB. Free memory was 211.4MB in the beginning and 175.8MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-02-09 00:51:39,511 INFO L158 Benchmark]: TraceAbstraction took 135197.16ms. Allocated memory was 240.1MB in the beginning and 7.1GB in the end (delta: 6.9GB). Free memory was 175.3MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. [2022-02-09 00:51:39,512 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.10ms. Allocated memory is still 184.5MB. Free memory is still 150.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 321.96ms. Allocated memory was 184.5MB in the beginning and 240.1MB in the end (delta: 55.6MB). Free memory was 133.5MB in the beginning and 215.6MB in the end (delta: -82.1MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.28ms. Allocated memory is still 240.1MB. Free memory was 215.6MB in the beginning and 213.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.14ms. Allocated memory is still 240.1MB. Free memory was 213.0MB in the beginning and 211.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 712.67ms. Allocated memory is still 240.1MB. Free memory was 211.4MB in the beginning and 175.8MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 135197.16ms. Allocated memory was 240.1MB in the beginning and 7.1GB in the end (delta: 6.9GB). Free memory was 175.3MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-09 00:51:39,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...