/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/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-32214ab [2023-05-19 22:27:21,331 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-19 22:27:21,333 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-19 22:27:21,364 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-19 22:27:21,365 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-19 22:27:21,367 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-19 22:27:21,371 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-19 22:27:21,375 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-19 22:27:21,376 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-19 22:27:21,381 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-19 22:27:21,382 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-19 22:27:21,384 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-19 22:27:21,385 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-19 22:27:21,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-19 22:27:21,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-19 22:27:21,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-19 22:27:21,390 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-19 22:27:21,390 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-19 22:27:21,392 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-19 22:27:21,397 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-19 22:27:21,398 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-19 22:27:21,399 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-19 22:27:21,401 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-19 22:27:21,402 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-19 22:27:21,408 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-19 22:27:21,408 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-19 22:27:21,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-19 22:27:21,410 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-19 22:27:21,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-19 22:27:21,411 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-19 22:27:21,411 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-19 22:27:21,412 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-19 22:27:21,413 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-19 22:27:21,414 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-19 22:27:21,415 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-19 22:27:21,415 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-19 22:27:21,416 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-19 22:27:21,416 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-19 22:27:21,416 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-19 22:27:21,417 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-19 22:27:21,417 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-19 22:27:21,418 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-19 22:27:21,450 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-19 22:27:21,451 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-19 22:27:21,451 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-19 22:27:21,451 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-19 22:27:21,452 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-19 22:27:21,452 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-19 22:27:21,453 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-19 22:27:21,453 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-19 22:27:21,453 INFO L138 SettingsManager]: * Use SBE=true [2023-05-19 22:27:21,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-19 22:27:21,454 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-19 22:27:21,454 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-19 22:27:21,454 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-19 22:27:21,454 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-19 22:27:21,454 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-19 22:27:21,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-19 22:27:21,454 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-19 22:27:21,454 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-19 22:27:21,455 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-19 22:27:21,455 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-19 22:27:21,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-19 22:27:21,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-19 22:27:21,455 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-19 22:27:21,456 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-19 22:27:21,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-19 22:27:21,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-19 22:27:21,457 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-19 22:27:21,457 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-19 22:27:21,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-19 22:27:21,457 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-19 22:27:21,457 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-19 22:27:21,457 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-19 22:27:21,457 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-19 22:27:21,458 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-19 22:27:21,458 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-19 22:27:21,458 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-19 22:27:21,458 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> true [2023-05-19 22:27:21,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-19 22:27:21,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-19 22:27:21,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-19 22:27:21,717 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-19 22:27:21,718 INFO L275 PluginConnector]: CDTParser initialized [2023-05-19 22:27:21,719 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2023-05-19 22:27:21,789 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ade96bba0/1549a61c0c644e15ba763c48ac5e37e3/FLAG756080f07 [2023-05-19 22:27:22,242 INFO L306 CDTParser]: Found 1 translation units. [2023-05-19 22:27:22,243 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2023-05-19 22:27:22,268 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ade96bba0/1549a61c0c644e15ba763c48ac5e37e3/FLAG756080f07 [2023-05-19 22:27:22,570 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ade96bba0/1549a61c0c644e15ba763c48ac5e37e3 [2023-05-19 22:27:22,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-19 22:27:22,575 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-19 22:27:22,578 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-19 22:27:22,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-19 22:27:22,587 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-19 22:27:22,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.05 10:27:22" (1/1) ... [2023-05-19 22:27:22,590 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fef90ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 10:27:22, skipping insertion in model container [2023-05-19 22:27:22,591 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.05 10:27:22" (1/1) ... [2023-05-19 22:27:22,597 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-19 22:27:22,630 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-19 22:27:23,008 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i[41323,41336] [2023-05-19 22:27:23,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-19 22:27:23,047 INFO L203 MainTranslator]: Completed pre-run [2023-05-19 22:27:23,082 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i[41323,41336] [2023-05-19 22:27:23,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-19 22:27:23,137 INFO L208 MainTranslator]: Completed translation [2023-05-19 22:27:23,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 10:27:23 WrapperNode [2023-05-19 22:27:23,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-19 22:27:23,138 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-19 22:27:23,138 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-19 22:27:23,139 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-19 22:27:23,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 10:27:23" (1/1) ... [2023-05-19 22:27:23,169 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 10:27:23" (1/1) ... [2023-05-19 22:27:23,195 INFO L138 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 189 [2023-05-19 22:27:23,195 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-19 22:27:23,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-19 22:27:23,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-19 22:27:23,196 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-19 22:27:23,202 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 10:27:23" (1/1) ... [2023-05-19 22:27:23,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 10:27:23" (1/1) ... [2023-05-19 22:27:23,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 10:27:23" (1/1) ... [2023-05-19 22:27:23,207 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 10:27:23" (1/1) ... [2023-05-19 22:27:23,219 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 10:27:23" (1/1) ... [2023-05-19 22:27:23,232 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 10:27:23" (1/1) ... [2023-05-19 22:27:23,234 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 10:27:23" (1/1) ... [2023-05-19 22:27:23,236 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 10:27:23" (1/1) ... [2023-05-19 22:27:23,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-19 22:27:23,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-19 22:27:23,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-19 22:27:23,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-19 22:27:23,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 10:27:23" (1/1) ... [2023-05-19 22:27:23,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-19 22:27:23,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 22:27:23,271 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) [2023-05-19 22:27:23,288 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 [2023-05-19 22:27:23,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-19 22:27:23,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-19 22:27:23,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-19 22:27:23,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-19 22:27:23,317 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-05-19 22:27:23,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-19 22:27:23,317 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-05-19 22:27:23,317 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-05-19 22:27:23,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-19 22:27:23,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-19 22:27:23,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-19 22:27:23,319 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-19 22:27:23,487 INFO L235 CfgBuilder]: Building ICFG [2023-05-19 22:27:23,491 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-19 22:27:23,769 INFO L276 CfgBuilder]: Performing block encoding [2023-05-19 22:27:23,781 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-19 22:27:23,782 INFO L300 CfgBuilder]: Removed 23 assume(true) statements. [2023-05-19 22:27:23,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.05 10:27:23 BoogieIcfgContainer [2023-05-19 22:27:23,784 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-19 22:27:23,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-19 22:27:23,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-19 22:27:23,792 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-19 22:27:23,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.05 10:27:22" (1/3) ... [2023-05-19 22:27:23,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41704293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.05 10:27:23, skipping insertion in model container [2023-05-19 22:27:23,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 10:27:23" (2/3) ... [2023-05-19 22:27:23,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41704293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.05 10:27:23, skipping insertion in model container [2023-05-19 22:27:23,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.05 10:27:23" (3/3) ... [2023-05-19 22:27:23,798 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_76-tricky_address3_racefree.i [2023-05-19 22:27:23,806 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-19 22:27:23,814 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-19 22:27:23,814 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-05-19 22:27:23,814 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-19 22:27:23,919 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-05-19 22:27:23,980 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-19 22:27:23,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-19 22:27:23,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 22:27:23,982 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-19 22:27:24,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-05-19 22:27:24,026 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-19 22:27:24,059 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2023-05-19 22:27:24,063 INFO L357 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=PARTIAL_ORDER_FA, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6c7b9c94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-19 22:27:24,063 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-19 22:27:24,338 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-19 22:27:24,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 22:27:24,343 INFO L85 PathProgramCache]: Analyzing trace with hash 601825820, now seen corresponding path program 1 times [2023-05-19 22:27:24,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 22:27:24,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747158646] [2023-05-19 22:27:24,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:27:24,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 22:27:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:27:24,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-19 22:27:24,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 22:27:24,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747158646] [2023-05-19 22:27:24,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747158646] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-19 22:27:24,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-19 22:27:24,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-19 22:27:24,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555684165] [2023-05-19 22:27:24,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-19 22:27:24,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-19 22:27:24,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 22:27:24,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-19 22:27:24,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-19 22:27:24,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:27:24,763 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 22:27:24,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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) [2023-05-19 22:27:24,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:27:24,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:27:24,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-19 22:27:24,812 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-19 22:27:24,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 22:27:24,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1037750960, now seen corresponding path program 1 times [2023-05-19 22:27:24,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 22:27:24,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339848683] [2023-05-19 22:27:24,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:27:24,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 22:27:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:27:25,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-19 22:27:25,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 22:27:25,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339848683] [2023-05-19 22:27:25,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339848683] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-19 22:27:25,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610048162] [2023-05-19 22:27:25,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:27:25,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:27:25,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 22:27:25,034 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) [2023-05-19 22:27:25,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-05-19 22:27:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:27:25,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-19 22:27:25,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-19 22:27:25,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-19 22:27:25,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-19 22:27:25,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-19 22:27:25,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610048162] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-19 22:27:25,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-19 22:27:25,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-19 22:27:25,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285758771] [2023-05-19 22:27:25,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-19 22:27:25,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-19 22:27:25,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 22:27:25,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-19 22:27:25,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-19 22:27:25,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:27:25,332 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 22:27:25,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 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) [2023-05-19 22:27:25,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:27:25,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:27:25,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:27:25,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:27:25,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-05-19 22:27:25,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-05-19 22:27:25,665 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-19 22:27:25,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 22:27:25,666 INFO L85 PathProgramCache]: Analyzing trace with hash 396333104, now seen corresponding path program 2 times [2023-05-19 22:27:25,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 22:27:25,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6424809] [2023-05-19 22:27:25,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:27:25,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 22:27:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:27:25,877 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-19 22:27:25,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 22:27:25,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6424809] [2023-05-19 22:27:25,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6424809] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-19 22:27:25,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192594997] [2023-05-19 22:27:25,883 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-19 22:27:25,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:27:25,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 22:27:25,885 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) [2023-05-19 22:27:25,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-05-19 22:27:25,992 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-19 22:27:25,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-19 22:27:25,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-19 22:27:25,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-19 22:27:26,064 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-19 22:27:26,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-19 22:27:26,136 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-19 22:27:26,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192594997] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-19 22:27:26,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-19 22:27:26,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-19 22:27:26,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438776577] [2023-05-19 22:27:26,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-19 22:27:26,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-19 22:27:26,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 22:27:26,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-19 22:27:26,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-19 22:27:26,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:27:26,140 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 22:27:26,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.8) internal successors, (138), 10 states have internal predecessors, (138), 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) [2023-05-19 22:27:26,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:27:26,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:27:26,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:27:26,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:27:26,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:27:26,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-19 22:27:26,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-05-19 22:27:26,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:27:26,429 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-19 22:27:26,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 22:27:26,430 INFO L85 PathProgramCache]: Analyzing trace with hash 739945645, now seen corresponding path program 1 times [2023-05-19 22:27:26,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 22:27:26,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342340189] [2023-05-19 22:27:26,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:27:26,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 22:27:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:27:26,632 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-19 22:27:26,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 22:27:26,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342340189] [2023-05-19 22:27:26,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342340189] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-19 22:27:26,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074371290] [2023-05-19 22:27:26,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:27:26,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:27:26,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 22:27:26,636 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) [2023-05-19 22:27:26,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-05-19 22:27:26,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:27:26,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-19 22:27:26,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-19 22:27:26,788 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-19 22:27:26,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-19 22:27:26,880 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-19 22:27:26,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074371290] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-19 22:27:26,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-19 22:27:26,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-05-19 22:27:26,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308816087] [2023-05-19 22:27:26,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-19 22:27:26,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-05-19 22:27:26,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 22:27:26,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-05-19 22:27:26,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-05-19 22:27:26,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:27:26,886 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 22:27:26,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.166666666666667) internal successors, (111), 18 states have internal predecessors, (111), 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) [2023-05-19 22:27:26,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:27:26,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:27:26,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-19 22:27:26,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:27:27,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:27:27,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:27:27,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-19 22:27:27,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-19 22:27:27,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-05-19 22:27:27,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:27:27,289 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-19 22:27:27,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 22:27:27,290 INFO L85 PathProgramCache]: Analyzing trace with hash 2076359277, now seen corresponding path program 2 times [2023-05-19 22:27:27,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 22:27:27,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579854450] [2023-05-19 22:27:27,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:27:27,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 22:27:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:27:27,602 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-19 22:27:27,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 22:27:27,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579854450] [2023-05-19 22:27:27,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579854450] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-19 22:27:27,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818340710] [2023-05-19 22:27:27,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-19 22:27:27,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:27:27,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 22:27:27,605 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) [2023-05-19 22:27:27,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-05-19 22:27:27,712 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-19 22:27:27,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-19 22:27:27,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-19 22:27:27,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-19 22:27:27,795 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-19 22:27:27,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-19 22:27:27,965 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-19 22:27:27,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818340710] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-19 22:27:27,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-19 22:27:27,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2023-05-19 22:27:27,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671931771] [2023-05-19 22:27:27,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-19 22:27:27,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-05-19 22:27:27,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 22:27:27,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-05-19 22:27:27,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-05-19 22:27:27,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:27:27,967 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 22:27:27,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 23 states have internal predecessors, (126), 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) [2023-05-19 22:27:27,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:27:27,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:27:27,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-19 22:27:27,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-19 22:27:27,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:27:28,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:27:28,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:27:28,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-19 22:27:28,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-19 22:27:28,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-19 22:27:28,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-05-19 22:27:28,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:27:28,436 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-19 22:27:28,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 22:27:28,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1590835272, now seen corresponding path program 3 times [2023-05-19 22:27:28,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 22:27:28,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644320646] [2023-05-19 22:27:28,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:27:28,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 22:27:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:27:29,137 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-19 22:27:29,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 22:27:29,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644320646] [2023-05-19 22:27:29,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644320646] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-19 22:27:29,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843753587] [2023-05-19 22:27:29,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-19 22:27:29,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:27:29,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 22:27:29,140 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) [2023-05-19 22:27:29,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-05-19 22:27:29,248 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-05-19 22:27:29,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-19 22:27:29,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 20 conjunts are in the unsatisfiable core [2023-05-19 22:27:29,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-19 22:27:29,295 INFO L390 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 7 treesize of output 6 [2023-05-19 22:27:29,794 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-19 22:27:29,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-05-19 22:27:29,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-19 22:27:29,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-19 22:27:30,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-19 22:27:30,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-19 22:27:30,094 INFO L390 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 14 treesize of output 10 [2023-05-19 22:27:30,139 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-19 22:27:30,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-19 22:27:32,205 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_~p~0#1.offset| Int) (v_ArrVal_220 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_220) |c_t_funThread1of1ForFork0_~p~0#1.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-19 22:27:34,265 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_~p~0#1.offset| Int) (v_ArrVal_220 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_220) |c_~#a~0.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-19 22:27:34,881 INFO L390 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 9 treesize of output 7 [2023-05-19 22:27:34,906 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-19 22:27:34,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 12 [2023-05-19 22:27:34,912 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 5 not checked. [2023-05-19 22:27:34,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843753587] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-19 22:27:34,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-19 22:27:34,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2023-05-19 22:27:34,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670549329] [2023-05-19 22:27:34,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-19 22:27:34,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-05-19 22:27:34,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 22:27:34,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-05-19 22:27:34,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=289, Unknown=3, NotChecked=70, Total=420 [2023-05-19 22:27:34,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:27:34,914 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 22:27:34,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.238095238095237) internal successors, (194), 21 states have internal predecessors, (194), 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) [2023-05-19 22:27:34,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:27:34,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:27:34,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-19 22:27:34,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-19 22:27:34,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-19 22:27:34,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:27:53,030 WARN L233 SmtUtils]: Spent 18.04s on a formula simplification. DAG size of input: 24 DAG size of output: 19 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-19 22:28:11,111 WARN L233 SmtUtils]: Spent 18.04s on a formula simplification. DAG size of input: 25 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-19 22:28:11,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:28:11,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:28:11,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-19 22:28:11,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-19 22:28:11,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-19 22:28:11,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-19 22:28:11,575 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-19 22:28:11,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-05-19 22:28:11,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:28:11,802 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1] [2023-05-19 22:28:11,803 INFO L307 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE (1/2) [2023-05-19 22:28:11,807 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-19 22:28:11,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-19 22:28:11,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 22:28:11,810 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-19 22:28:11,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2023-05-19 22:28:11,817 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-19 22:28:11,821 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-19 22:28:11,821 INFO L357 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=PARTIAL_ORDER_FA, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6c7b9c94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-19 22:28:11,822 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-05-19 22:28:11,927 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-19 22:28:11,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 22:28:11,927 INFO L85 PathProgramCache]: Analyzing trace with hash -102541793, now seen corresponding path program 1 times [2023-05-19 22:28:11,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 22:28:11,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760645172] [2023-05-19 22:28:11,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:28:11,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 22:28:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:28:11,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-19 22:28:11,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 22:28:11,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760645172] [2023-05-19 22:28:11,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760645172] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-19 22:28:11,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-19 22:28:11,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-19 22:28:11,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708843306] [2023-05-19 22:28:11,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-19 22:28:11,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-19 22:28:11,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 22:28:11,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-19 22:28:11,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-19 22:28:11,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:28:11,976 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 22:28:11,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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) [2023-05-19 22:28:11,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:28:11,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:28:11,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-05-19 22:28:11,993 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-19 22:28:11,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 22:28:11,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1795768870, now seen corresponding path program 1 times [2023-05-19 22:28:11,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 22:28:11,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233885819] [2023-05-19 22:28:11,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:28:11,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 22:28:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:28:12,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-19 22:28:12,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 22:28:12,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233885819] [2023-05-19 22:28:12,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233885819] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-19 22:28:12,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119972872] [2023-05-19 22:28:12,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:28:12,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:28:12,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 22:28:12,062 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-19 22:28:12,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-05-19 22:28:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:28:12,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-19 22:28:12,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-19 22:28:12,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-19 22:28:12,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-19 22:28:12,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-19 22:28:12,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119972872] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-19 22:28:12,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-19 22:28:12,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-19 22:28:12,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084173207] [2023-05-19 22:28:12,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-19 22:28:12,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-19 22:28:12,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 22:28:12,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-19 22:28:12,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-19 22:28:12,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:28:12,200 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 22:28:12,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 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) [2023-05-19 22:28:12,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:28:12,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:28:12,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:28:12,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:28:12,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-05-19 22:28:12,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-05-19 22:28:12,465 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-19 22:28:12,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 22:28:12,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1877295366, now seen corresponding path program 2 times [2023-05-19 22:28:12,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 22:28:12,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808139790] [2023-05-19 22:28:12,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:28:12,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 22:28:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:28:12,563 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-19 22:28:12,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 22:28:12,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808139790] [2023-05-19 22:28:12,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808139790] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-19 22:28:12,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053550357] [2023-05-19 22:28:12,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-19 22:28:12,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:28:12,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 22:28:12,565 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-19 22:28:12,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-05-19 22:28:12,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-19 22:28:12,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-19 22:28:12,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-19 22:28:12,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-19 22:28:12,680 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-19 22:28:12,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-19 22:28:12,763 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-19 22:28:12,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053550357] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-19 22:28:12,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-19 22:28:12,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-05-19 22:28:12,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946914451] [2023-05-19 22:28:12,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-19 22:28:12,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-05-19 22:28:12,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 22:28:12,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-05-19 22:28:12,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-05-19 22:28:12,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:28:12,767 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 22:28:12,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 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) [2023-05-19 22:28:12,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:28:12,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:28:12,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:28:12,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:28:12,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:28:12,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-19 22:28:12,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-05-19 22:28:13,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:28:13,131 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-19 22:28:13,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 22:28:13,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1665136326, now seen corresponding path program 3 times [2023-05-19 22:28:13,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 22:28:13,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009346219] [2023-05-19 22:28:13,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:28:13,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 22:28:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:28:13,406 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-19 22:28:13,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 22:28:13,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009346219] [2023-05-19 22:28:13,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009346219] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-19 22:28:13,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851466669] [2023-05-19 22:28:13,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-19 22:28:13,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:28:13,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 22:28:13,409 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-19 22:28:13,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-05-19 22:28:13,520 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-05-19 22:28:13,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-19 22:28:13,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-19 22:28:13,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-19 22:28:13,593 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-19 22:28:13,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-19 22:28:13,768 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-19 22:28:13,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851466669] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-19 22:28:13,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-19 22:28:13,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2023-05-19 22:28:13,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69075808] [2023-05-19 22:28:13,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-19 22:28:13,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-05-19 22:28:13,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 22:28:13,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-05-19 22:28:13,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-05-19 22:28:13,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:28:13,770 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 22:28:13,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 23 states have internal predecessors, (107), 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) [2023-05-19 22:28:13,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:28:13,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:28:13,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-19 22:28:13,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:28:14,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:28:14,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:28:14,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-19 22:28:14,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-19 22:28:14,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-05-19 22:28:14,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-05-19 22:28:14,244 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-19 22:28:14,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 22:28:14,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1430535729, now seen corresponding path program 4 times [2023-05-19 22:28:14,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 22:28:14,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136508929] [2023-05-19 22:28:14,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:28:14,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 22:28:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-19 22:28:14,271 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-19 22:28:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-19 22:28:14,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-19 22:28:14,307 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-19 22:28:14,308 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-05-19 22:28:14,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-05-19 22:28:14,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-05-19 22:28:14,309 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1] [2023-05-19 22:28:14,310 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/2) [2023-05-19 22:28:14,310 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-05-19 22:28:14,310 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-05-19 22:28:14,342 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-05-19 22:28:14,349 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-19 22:28:14,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-19 22:28:14,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 22:28:14,350 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-19 22:28:14,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (12)] Waiting until timeout for monitored process [2023-05-19 22:28:14,355 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-19 22:28:14,359 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2023-05-19 22:28:14,360 INFO L357 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=PARTIAL_ORDER_FA, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6c7b9c94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-19 22:28:14,360 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-19 22:28:14,485 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-19 22:28:14,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 22:28:14,485 INFO L85 PathProgramCache]: Analyzing trace with hash 554594078, now seen corresponding path program 1 times [2023-05-19 22:28:14,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 22:28:14,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145484508] [2023-05-19 22:28:14,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:28:14,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 22:28:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:28:14,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-05-19 22:28:14,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 22:28:14,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145484508] [2023-05-19 22:28:14,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145484508] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-19 22:28:14,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-19 22:28:14,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-19 22:28:14,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209621073] [2023-05-19 22:28:14,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-19 22:28:14,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-19 22:28:14,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 22:28:14,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-19 22:28:14,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-19 22:28:14,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:28:14,546 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 22:28:14,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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) [2023-05-19 22:28:14,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:28:25,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:28:25,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-05-19 22:28:25,823 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-19 22:28:25,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 22:28:25,824 INFO L85 PathProgramCache]: Analyzing trace with hash 867180332, now seen corresponding path program 1 times [2023-05-19 22:28:25,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 22:28:25,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758846408] [2023-05-19 22:28:25,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:28:25,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 22:28:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:28:25,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-19 22:28:25,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 22:28:25,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758846408] [2023-05-19 22:28:25,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758846408] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-19 22:28:25,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740085881] [2023-05-19 22:28:25,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:28:25,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:28:25,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 22:28:25,886 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-19 22:28:25,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-05-19 22:28:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:28:25,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-19 22:28:25,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-19 22:28:25,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-19 22:28:25,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-19 22:28:26,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-19 22:28:26,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740085881] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-19 22:28:26,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-19 22:28:26,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-19 22:28:26,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529476854] [2023-05-19 22:28:26,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-19 22:28:26,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-19 22:28:26,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 22:28:26,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-19 22:28:26,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-19 22:28:26,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:28:26,024 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 22:28:26,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 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) [2023-05-19 22:28:26,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:28:26,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:28:30,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:28:30,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:28:30,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-05-19 22:28:30,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-05-19 22:28:30,581 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-19 22:28:30,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 22:28:30,581 INFO L85 PathProgramCache]: Analyzing trace with hash 459308, now seen corresponding path program 2 times [2023-05-19 22:28:30,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 22:28:30,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585344803] [2023-05-19 22:28:30,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:28:30,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 22:28:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:28:30,654 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-19 22:28:30,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 22:28:30,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585344803] [2023-05-19 22:28:30,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585344803] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-19 22:28:30,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817590014] [2023-05-19 22:28:30,655 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-19 22:28:30,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:28:30,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 22:28:30,657 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-19 22:28:30,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-05-19 22:28:30,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-19 22:28:30,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-19 22:28:30,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-19 22:28:30,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-19 22:28:30,795 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-19 22:28:30,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-19 22:28:30,852 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-19 22:28:30,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817590014] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-19 22:28:30,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-19 22:28:30,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-19 22:28:30,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919209837] [2023-05-19 22:28:30,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-19 22:28:30,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-19 22:28:30,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 22:28:30,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-19 22:28:30,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-19 22:28:30,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:28:30,855 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 22:28:30,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.8) internal successors, (138), 10 states have internal predecessors, (138), 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) [2023-05-19 22:28:30,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:28:30,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:28:30,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:28:31,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:28:31,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:28:31,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:28:31,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-05-19 22:28:31,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-05-19 22:28:31,862 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-19 22:28:31,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 22:28:31,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1589629371, now seen corresponding path program 1 times [2023-05-19 22:28:31,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 22:28:31,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787200805] [2023-05-19 22:28:31,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:28:31,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 22:28:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:28:31,975 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-05-19 22:28:31,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 22:28:31,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787200805] [2023-05-19 22:28:31,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787200805] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-19 22:28:31,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262598177] [2023-05-19 22:28:31,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:28:31,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:28:31,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 22:28:31,978 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-19 22:28:31,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-05-19 22:28:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:28:32,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-19 22:28:32,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-19 22:28:32,115 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-05-19 22:28:32,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-19 22:28:32,196 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-05-19 22:28:32,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262598177] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-19 22:28:32,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-19 22:28:32,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-05-19 22:28:32,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453471390] [2023-05-19 22:28:32,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-19 22:28:32,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-05-19 22:28:32,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 22:28:32,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-05-19 22:28:32,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-05-19 22:28:32,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:28:32,198 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 22:28:32,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.055555555555555) internal successors, (127), 18 states have internal predecessors, (127), 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) [2023-05-19 22:28:32,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:28:32,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:28:32,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:28:32,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:28:33,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:28:33,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:28:33,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:28:33,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-19 22:28:33,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-05-19 22:28:33,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:28:33,218 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-19 22:28:33,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 22:28:33,219 INFO L85 PathProgramCache]: Analyzing trace with hash 501934149, now seen corresponding path program 2 times [2023-05-19 22:28:33,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 22:28:33,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441277597] [2023-05-19 22:28:33,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:28:33,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 22:28:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:28:33,505 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-05-19 22:28:33,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 22:28:33,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441277597] [2023-05-19 22:28:33,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441277597] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-19 22:28:33,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507342955] [2023-05-19 22:28:33,506 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-19 22:28:33,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:28:33,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 22:28:33,507 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-19 22:28:33,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-05-19 22:28:33,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-19 22:28:33,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-19 22:28:33,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-19 22:28:33,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-19 22:28:33,696 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-05-19 22:28:33,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-19 22:28:33,874 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-05-19 22:28:33,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507342955] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-19 22:28:33,875 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-19 22:28:33,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2023-05-19 22:28:33,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776881297] [2023-05-19 22:28:33,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-19 22:28:33,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-05-19 22:28:33,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 22:28:33,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-05-19 22:28:33,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-05-19 22:28:33,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:28:33,877 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 22:28:33,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.173913043478261) internal successors, (142), 23 states have internal predecessors, (142), 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) [2023-05-19 22:28:33,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:28:33,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:28:33,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:28:33,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-19 22:28:33,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:28:34,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:28:34,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:28:34,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:28:34,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-19 22:28:34,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-19 22:28:34,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-05-19 22:28:34,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-05-19 22:28:34,871 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-19 22:28:34,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 22:28:34,872 INFO L85 PathProgramCache]: Analyzing trace with hash 2102538765, now seen corresponding path program 3 times [2023-05-19 22:28:34,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 22:28:34,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843860121] [2023-05-19 22:28:34,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:28:34,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 22:28:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:28:36,442 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-19 22:28:36,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 22:28:36,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843860121] [2023-05-19 22:28:36,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843860121] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-19 22:28:36,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264017639] [2023-05-19 22:28:36,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-19 22:28:36,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:28:36,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 22:28:36,445 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-19 22:28:36,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-05-19 22:28:36,560 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-05-19 22:28:36,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-19 22:28:36,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 25 conjunts are in the unsatisfiable core [2023-05-19 22:28:36,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-19 22:28:36,658 INFO L390 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 7 treesize of output 6 [2023-05-19 22:28:37,513 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-05-19 22:28:37,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-05-19 22:28:37,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-19 22:28:37,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-19 22:28:37,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-19 22:28:37,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-19 22:28:38,000 INFO L390 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 14 treesize of output 10 [2023-05-19 22:28:38,057 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-19 22:28:38,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-19 22:28:46,140 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_586 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_586) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-19 22:28:46,177 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_586 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_586) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-19 22:28:46,848 INFO L390 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 9 treesize of output 7 [2023-05-19 22:28:46,968 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-19 22:28:46,979 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2023-05-19 22:28:46,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 23 [2023-05-19 22:28:46,988 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 10 not checked. [2023-05-19 22:28:46,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264017639] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-19 22:28:46,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-19 22:28:46,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 36 [2023-05-19 22:28:46,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443753709] [2023-05-19 22:28:46,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-19 22:28:46,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-05-19 22:28:46,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 22:28:46,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-05-19 22:28:46,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=989, Unknown=5, NotChecked=130, Total=1260 [2023-05-19 22:28:46,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:28:46,991 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 22:28:46,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 8.166666666666666) internal successors, (294), 36 states have internal predecessors, (294), 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) [2023-05-19 22:28:46,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:28:46,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:28:46,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:28:46,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-19 22:28:46,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-19 22:28:46,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:29:17,219 WARN L233 SmtUtils]: Spent 30.07s on a formula simplification. DAG size of input: 37 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-19 22:30:09,294 WARN L233 SmtUtils]: Spent 52.06s on a formula simplification. DAG size of input: 30 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-19 22:30:59,442 WARN L233 SmtUtils]: Spent 50.08s on a formula simplification. DAG size of input: 62 DAG size of output: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-19 22:31:00,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:31:00,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:31:00,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:31:00,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-19 22:31:00,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-19 22:31:00,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-05-19 22:31:00,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-05-19 22:31:00,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-05-19 22:31:00,873 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-19 22:31:00,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 22:31:00,874 INFO L85 PathProgramCache]: Analyzing trace with hash -643796611, now seen corresponding path program 1 times [2023-05-19 22:31:00,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 22:31:00,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179751102] [2023-05-19 22:31:00,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:31:00,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 22:31:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:31:01,009 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-05-19 22:31:01,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 22:31:01,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179751102] [2023-05-19 22:31:01,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179751102] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-19 22:31:01,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-19 22:31:01,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-19 22:31:01,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170654435] [2023-05-19 22:31:01,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-19 22:31:01,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-19 22:31:01,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 22:31:01,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-19 22:31:01,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-19 22:31:01,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:31:01,011 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 22:31:01,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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) [2023-05-19 22:31:01,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:31:01,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:31:01,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:31:01,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-19 22:31:01,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-19 22:31:01,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-05-19 22:31:01,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:31:01,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:31:01,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:31:01,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:31:01,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-19 22:31:01,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-19 22:31:01,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-05-19 22:31:01,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:31:01,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-05-19 22:31:01,655 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-19 22:31:01,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 22:31:01,656 INFO L85 PathProgramCache]: Analyzing trace with hash 727265269, now seen corresponding path program 1 times [2023-05-19 22:31:01,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 22:31:01,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515468862] [2023-05-19 22:31:01,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:31:01,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 22:31:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:31:10,341 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-19 22:31:10,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 22:31:10,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515468862] [2023-05-19 22:31:10,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515468862] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-19 22:31:10,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116632455] [2023-05-19 22:31:10,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:31:10,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:31:10,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 22:31:10,343 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-19 22:31:10,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-05-19 22:31:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:31:10,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 31 conjunts are in the unsatisfiable core [2023-05-19 22:31:10,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-19 22:31:10,544 INFO L390 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 7 treesize of output 6 [2023-05-19 22:31:10,870 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-19 22:31:10,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-05-19 22:31:10,934 INFO L390 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 13 treesize of output 15 [2023-05-19 22:31:11,029 INFO L390 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 13 treesize of output 9 [2023-05-19 22:31:11,227 INFO L390 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 13 treesize of output 15 [2023-05-19 22:31:11,380 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-19 22:31:11,381 INFO L390 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 19 treesize of output 11 [2023-05-19 22:31:11,575 INFO L390 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 13 treesize of output 15 [2023-05-19 22:31:11,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 18 treesize of output 13 [2023-05-19 22:31:11,757 INFO L390 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 17 treesize of output 13 [2023-05-19 22:31:11,850 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-19 22:31:11,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-19 22:31:15,494 INFO L390 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 18 treesize of output 12 [2023-05-19 22:31:15,523 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_713 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_715 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_713))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_715))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |t_funThread1of2ForFork0_~p~0#1.offset| |t_funThread2of2ForFork0_~p~0#1.offset|))) (or (forall ((v_ArrVal_713 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_715 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_713))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_715))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))) is different from false [2023-05-19 22:31:17,534 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_713 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_715 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_713) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_715) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |t_funThread1of2ForFork0_~p~0#1.offset| |t_funThread2of2ForFork0_~p~0#1.offset|))) is different from false [2023-05-19 22:31:18,442 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-19 22:31:18,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 9 treesize of output 7 [2023-05-19 22:31:18,484 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-19 22:31:18,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 12 [2023-05-19 22:31:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 235 trivial. 10 not checked. [2023-05-19 22:31:18,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116632455] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-19 22:31:18,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-19 22:31:18,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 15, 15] total 58 [2023-05-19 22:31:18,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172606292] [2023-05-19 22:31:18,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-19 22:31:18,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-05-19 22:31:18,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 22:31:18,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-05-19 22:31:18,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=2747, Unknown=8, NotChecked=218, Total=3306 [2023-05-19 22:31:18,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:31:18,493 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 22:31:18,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 6.5) internal successors, (377), 58 states have internal predecessors, (377), 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) [2023-05-19 22:31:18,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:31:18,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:31:18,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:31:18,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-19 22:31:18,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-19 22:31:18,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-05-19 22:31:18,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:31:18,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:31:37,902 WARN L233 SmtUtils]: Spent 18.04s on a formula simplification. DAG size of input: 32 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-19 22:31:49,975 WARN L233 SmtUtils]: Spent 12.05s on a formula simplification. DAG size of input: 28 DAG size of output: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-19 22:32:26,153 WARN L233 SmtUtils]: Spent 36.13s on a formula simplification. DAG size of input: 41 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-19 22:32:50,298 WARN L233 SmtUtils]: Spent 22.09s on a formula simplification. DAG size of input: 41 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-19 22:33:48,571 WARN L233 SmtUtils]: Spent 58.19s on a formula simplification. DAG size of input: 41 DAG size of output: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-19 22:34:22,697 WARN L233 SmtUtils]: Spent 34.10s on a formula simplification. DAG size of input: 32 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-19 22:34:30,939 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification. DAG size of input: 43 DAG size of output: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-19 22:34:33,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:34:33,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:34:33,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:34:33,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-19 22:34:33,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-19 22:34:33,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-05-19 22:34:33,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:34:33,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2023-05-19 22:34:33,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-05-19 22:34:33,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:34:33,259 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-19 22:34:33,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 22:34:33,260 INFO L85 PathProgramCache]: Analyzing trace with hash -520499323, now seen corresponding path program 1 times [2023-05-19 22:34:33,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 22:34:33,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141585410] [2023-05-19 22:34:33,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:34:33,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 22:34:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:34:34,153 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-19 22:34:34,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 22:34:34,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141585410] [2023-05-19 22:34:34,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141585410] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-19 22:34:34,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124586599] [2023-05-19 22:34:34,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:34:34,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:34:34,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 22:34:34,155 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-19 22:34:34,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-05-19 22:34:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:34:34,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 39 conjunts are in the unsatisfiable core [2023-05-19 22:34:34,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-19 22:34:34,311 INFO L390 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 7 treesize of output 6 [2023-05-19 22:34:34,627 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-19 22:34:34,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-05-19 22:34:34,664 INFO L390 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 13 treesize of output 15 [2023-05-19 22:34:34,816 INFO L390 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 13 treesize of output 15 [2023-05-19 22:34:35,034 INFO L390 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 13 treesize of output 15 [2023-05-19 22:34:35,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 24 treesize of output 17 [2023-05-19 22:34:35,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 32 treesize of output 25 [2023-05-19 22:34:35,348 INFO L390 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 20 treesize of output 16 [2023-05-19 22:34:35,406 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-19 22:34:35,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-19 22:34:39,464 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread2of2ForFork0_#t~post40#1|))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-19 22:34:41,469 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread2of2ForFork0_#t~mem39#1|))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-19 22:34:43,475 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset|))))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-19 22:34:45,492 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread2of2ForFork0_#t~post37#1|)) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-19 22:34:47,498 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread2of2ForFork0_#t~mem36#1|)) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-19 22:34:49,537 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_813 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_813) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-19 22:34:49,632 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_813 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_813) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-19 22:34:50,067 INFO L390 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 9 treesize of output 7 [2023-05-19 22:34:50,099 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-19 22:34:50,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 12 [2023-05-19 22:34:50,103 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 11 not checked. [2023-05-19 22:34:50,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124586599] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-19 22:34:50,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-19 22:34:50,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 16] total 40 [2023-05-19 22:34:50,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787037115] [2023-05-19 22:34:50,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-19 22:34:50,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-05-19 22:34:50,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 22:34:50,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-05-19 22:34:50,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=941, Unknown=8, NotChecked=476, Total=1560 [2023-05-19 22:34:50,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:34:50,105 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 22:34:50,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 8.175) internal successors, (327), 40 states have internal predecessors, (327), 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) [2023-05-19 22:34:50,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:34:50,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:34:50,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:34:50,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-19 22:34:50,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-19 22:34:50,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-05-19 22:34:50,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:34:50,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2023-05-19 22:34:50,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:35:00,242 WARN L233 SmtUtils]: Spent 10.04s on a formula simplification. DAG size of input: 23 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-19 22:35:46,551 WARN L233 SmtUtils]: Spent 46.08s on a formula simplification. DAG size of input: 30 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-19 22:36:40,663 WARN L233 SmtUtils]: Spent 54.10s on a formula simplification. DAG size of input: 32 DAG size of output: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-19 22:37:02,725 WARN L233 SmtUtils]: Spent 22.05s on a formula simplification. DAG size of input: 28 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-19 22:37:10,807 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 30 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-19 22:38:14,191 WARN L233 SmtUtils]: Spent 1.04m on a formula simplification. DAG size of input: 35 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-19 22:38:15,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:38:15,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:38:15,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:38:15,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-19 22:38:15,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-19 22:38:15,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-05-19 22:38:15,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:38:15,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2023-05-19 22:38:15,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-05-19 22:38:15,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-05-19 22:38:15,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:38:15,873 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-19 22:38:15,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 22:38:15,873 INFO L85 PathProgramCache]: Analyzing trace with hash 800929791, now seen corresponding path program 2 times [2023-05-19 22:38:15,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 22:38:15,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488284321] [2023-05-19 22:38:15,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:38:15,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 22:38:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:38:16,887 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-19 22:38:16,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 22:38:16,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488284321] [2023-05-19 22:38:16,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488284321] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-19 22:38:16,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111224052] [2023-05-19 22:38:16,888 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-19 22:38:16,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:38:16,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 22:38:16,889 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-19 22:38:16,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-05-19 22:38:17,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-19 22:38:17,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-19 22:38:17,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 39 conjunts are in the unsatisfiable core [2023-05-19 22:38:17,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-19 22:38:17,070 INFO L390 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 7 treesize of output 6 [2023-05-19 22:38:17,355 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-19 22:38:17,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-05-19 22:38:17,379 INFO L390 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 13 treesize of output 15 [2023-05-19 22:38:17,525 INFO L390 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 13 treesize of output 15 [2023-05-19 22:38:17,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 24 treesize of output 17 [2023-05-19 22:38:17,879 INFO L390 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 28 treesize of output 28 [2023-05-19 22:38:17,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 32 treesize of output 25 [2023-05-19 22:38:17,998 INFO L390 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 20 treesize of output 16 [2023-05-19 22:38:18,053 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-19 22:38:18,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-19 22:38:20,107 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread2of2ForFork0_#t~post40#1|))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-19 22:38:22,112 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread2of2ForFork0_#t~mem39#1|))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-19 22:38:22,122 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_917 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_917))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread2of2ForFork0_#t~mem39#1|)))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-19 22:38:22,128 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_917 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_917))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) (select (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|))))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-19 22:38:22,148 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_917 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ |c_t_funThread2of2ForFork0_#t~post37#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_917))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread2of2ForFork0_#t~post37#1|))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-19 22:38:22,155 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_917 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ |c_t_funThread2of2ForFork0_#t~mem36#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_917))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread2of2ForFork0_#t~mem36#1|))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-19 22:38:22,161 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_917 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse2 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (let ((.cse1 (select .cse2 |t_funThread2of2ForFork0_~p~0#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse2 |t_funThread2of2ForFork0_~p~0#1.offset| (+ .cse1 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_917))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset| .cse1))))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-19 22:38:22,223 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_917 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse2 (select |c_#memory_int| |c_~#a~0.base|))) (let ((.cse1 (select .cse2 |t_funThread2of2ForFork0_~p~0#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_~#a~0.base| (store .cse2 |t_funThread2of2ForFork0_~p~0#1.offset| (+ .cse1 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_917))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| .cse1))))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-19 22:38:22,258 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_914 (Array Int Int)) (v_ArrVal_917 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_914))) (let ((.cse3 (select .cse2 |c_~#a~0.base|))) (let ((.cse1 (select .cse3 |t_funThread2of2ForFork0_~p~0#1.offset|))) (let ((.cse0 (store (store .cse2 |c_~#a~0.base| (store .cse3 |t_funThread2of2ForFork0_~p~0#1.offset| (+ .cse1 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_917))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| .cse1)))))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-19 22:38:24,324 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_914 (Array Int Int)) (v_ArrVal_917 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_914))) (let ((.cse1 (select .cse0 |c_~#a~0.base|))) (let ((.cse2 (select .cse1 |t_funThread2of2ForFork0_~p~0#1.offset|))) (store (select (store (store .cse0 |c_~#a~0.base| (store .cse1 |t_funThread2of2ForFork0_~p~0#1.offset| (+ .cse2 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_917) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| .cse2)))) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-19 22:38:24,852 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-19 22:38:24,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 44 treesize of output 47 [2023-05-19 22:38:24,871 INFO L390 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 97 treesize of output 93 [2023-05-19 22:38:24,941 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-19 22:38:24,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 12 [2023-05-19 22:38:24,946 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 20 not checked. [2023-05-19 22:38:24,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111224052] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-19 22:38:24,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-19 22:38:24,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 19] total 41 [2023-05-19 22:38:24,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489972970] [2023-05-19 22:38:24,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-19 22:38:24,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-05-19 22:38:24,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 22:38:24,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-05-19 22:38:24,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=835, Unknown=10, NotChecked=670, Total=1640 [2023-05-19 22:38:24,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:38:24,948 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 22:38:24,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 7.048780487804878) internal successors, (289), 41 states have internal predecessors, (289), 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) [2023-05-19 22:38:24,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:38:24,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:38:24,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:38:24,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-19 22:38:24,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-19 22:38:24,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-05-19 22:38:24,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:38:24,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 76 states. [2023-05-19 22:38:24,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-05-19 22:38:24,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:38:47,280 WARN L233 SmtUtils]: Spent 22.24s on a formula simplification. DAG size of input: 32 DAG size of output: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-19 22:39:27,810 WARN L233 SmtUtils]: Spent 40.23s on a formula simplification. DAG size of input: 37 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-19 22:39:55,963 WARN L233 SmtUtils]: Spent 28.14s on a formula simplification. DAG size of input: 37 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-19 22:40:05,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:40:05,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:40:05,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:40:05,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-19 22:40:05,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-19 22:40:05,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-05-19 22:40:05,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:40:05,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2023-05-19 22:40:05,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-05-19 22:40:05,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-05-19 22:40:05,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-05-19 22:40:05,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:40:05,833 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-19 22:40:05,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 22:40:05,833 INFO L85 PathProgramCache]: Analyzing trace with hash 2047456229, now seen corresponding path program 1 times [2023-05-19 22:40:05,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 22:40:05,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303480819] [2023-05-19 22:40:05,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:40:05,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 22:40:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:40:06,747 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-19 22:40:06,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 22:40:06,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303480819] [2023-05-19 22:40:06,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303480819] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-19 22:40:06,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082093688] [2023-05-19 22:40:06,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:40:06,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:40:06,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 22:40:06,749 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-19 22:40:06,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-05-19 22:40:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:40:06,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 39 conjunts are in the unsatisfiable core [2023-05-19 22:40:06,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-19 22:40:06,921 INFO L390 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 7 treesize of output 6 [2023-05-19 22:40:07,253 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-19 22:40:07,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-05-19 22:40:07,293 INFO L390 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 13 treesize of output 15 [2023-05-19 22:40:07,411 INFO L390 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 13 treesize of output 15 [2023-05-19 22:40:07,617 INFO L390 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 13 treesize of output 15 [2023-05-19 22:40:07,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 24 treesize of output 17 [2023-05-19 22:40:07,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 32 treesize of output 25 [2023-05-19 22:40:07,925 INFO L390 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 20 treesize of output 16 [2023-05-19 22:40:07,975 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-19 22:40:07,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-19 22:40:12,032 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread2of2ForFork0_#t~post40#1|))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-19 22:40:14,038 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread2of2ForFork0_#t~mem39#1|))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-19 22:40:16,044 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset|))))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-19 22:40:18,081 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread2of2ForFork0_#t~post37#1|)) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-19 22:40:20,087 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread2of2ForFork0_#t~mem36#1|)) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-19 22:40:24,132 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1021 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1021) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-19 22:40:24,195 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1021 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1021) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-19 22:40:24,605 INFO L390 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 9 treesize of output 7 [2023-05-19 22:40:24,634 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-19 22:40:24,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 12 [2023-05-19 22:40:24,638 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 11 not checked. [2023-05-19 22:40:24,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082093688] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-19 22:40:24,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-19 22:40:24,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 16] total 41 [2023-05-19 22:40:24,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489697103] [2023-05-19 22:40:24,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-19 22:40:24,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-05-19 22:40:24,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 22:40:24,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-05-19 22:40:24,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=997, Unknown=8, NotChecked=490, Total=1640 [2023-05-19 22:40:24,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:40:24,640 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 22:40:24,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 8.414634146341463) internal successors, (345), 41 states have internal predecessors, (345), 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) [2023-05-19 22:40:24,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:40:24,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:40:24,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:40:24,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-19 22:40:24,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-19 22:40:24,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-05-19 22:40:24,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:40:24,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2023-05-19 22:40:24,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-05-19 22:40:24,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-05-19 22:40:24,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:40:36,780 WARN L233 SmtUtils]: Spent 12.05s on a formula simplification. DAG size of input: 23 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-19 22:40:50,975 WARN L233 SmtUtils]: Spent 14.06s on a formula simplification. DAG size of input: 26 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-05-19 22:41:24,037 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-19 22:41:24,055 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-19 22:41:24,055 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-19 22:41:24,056 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-19 22:41:24,056 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-19 22:41:25,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2023-05-19 22:41:25,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Forceful destruction successful, exit code 0 [2023-05-19 22:41:25,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (12)] Forceful destruction successful, exit code 0 [2023-05-19 22:41:25,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-05-19 22:41:25,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-05-19 22:41:25,154 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:219) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:203) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:219) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:203) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:203) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:154) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.(NestedIterator.java:62) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIteratorNoopConstruction.(NestedIteratorNoopConstruction.java:48) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$1(INwaOutgoingLetterAndTransitionProvider.java:124) at java.base/java.lang.Iterable.spliterator(Iterable.java:101) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:235) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.automata.partialorder.PersistentSetReduction.applyNewStateReduction(PersistentSetReduction.java:73) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:267) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2023-05-19 22:41:25,156 INFO L158 Benchmark]: Toolchain (without parser) took 842581.07ms. Allocated memory was 186.6MB in the beginning and 6.1GB in the end (delta: 6.0GB). Free memory was 155.1MB in the beginning and 4.5GB in the end (delta: -4.3GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2023-05-19 22:41:25,156 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 186.6MB. Free memory is still 140.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-19 22:41:25,156 INFO L158 Benchmark]: CACSL2BoogieTranslator took 560.03ms. Allocated memory was 186.6MB in the beginning and 246.4MB in the end (delta: 59.8MB). Free memory was 154.9MB in the beginning and 195.4MB in the end (delta: -40.5MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-05-19 22:41:25,156 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.14ms. Allocated memory is still 246.4MB. Free memory was 195.4MB in the beginning and 192.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-19 22:41:25,156 INFO L158 Benchmark]: Boogie Preprocessor took 43.46ms. Allocated memory is still 246.4MB. Free memory was 192.8MB in the beginning and 190.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-19 22:41:25,157 INFO L158 Benchmark]: RCFGBuilder took 543.81ms. Allocated memory is still 246.4MB. Free memory was 190.7MB in the beginning and 171.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-05-19 22:41:25,157 INFO L158 Benchmark]: TraceAbstraction took 841369.31ms. Allocated memory was 246.4MB in the beginning and 6.1GB in the end (delta: 5.9GB). Free memory was 170.8MB in the beginning and 4.5GB in the end (delta: -4.3GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2023-05-19 22:41:25,158 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.54ms. Allocated memory is still 186.6MB. Free memory is still 140.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 560.03ms. Allocated memory was 186.6MB in the beginning and 246.4MB in the end (delta: 59.8MB). Free memory was 154.9MB in the beginning and 195.4MB in the end (delta: -40.5MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.14ms. Allocated memory is still 246.4MB. Free memory was 195.4MB in the beginning and 192.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.46ms. Allocated memory is still 246.4MB. Free memory was 192.8MB in the beginning and 190.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 543.81ms. Allocated memory is still 246.4MB. Free memory was 190.7MB in the beginning and 171.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 841369.31ms. Allocated memory was 246.4MB in the beginning and 6.1GB in the end (delta: 5.9GB). Free memory was 170.8MB in the beginning and 4.5GB in the end (delta: -4.3GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8667, independent: 8061, independent conditional: 1096, independent unconditional: 6965, dependent: 606, dependent conditional: 558, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8111, independent: 8061, independent conditional: 1096, independent unconditional: 6965, dependent: 50, dependent conditional: 2, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8111, independent: 8061, independent conditional: 1096, independent unconditional: 6965, dependent: 50, dependent conditional: 2, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8116, independent: 8061, independent conditional: 3, independent unconditional: 8058, dependent: 55, dependent conditional: 2, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8116, independent: 8061, independent conditional: 3, independent unconditional: 8058, dependent: 55, dependent conditional: 2, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8116, independent: 8061, independent conditional: 3, independent unconditional: 8058, dependent: 55, dependent conditional: 2, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5460, independent: 5410, independent conditional: 3, independent unconditional: 5407, dependent: 50, dependent conditional: 2, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5460, independent: 5385, independent conditional: 0, independent unconditional: 5385, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 75, independent: 25, independent conditional: 3, independent unconditional: 22, dependent: 50, dependent conditional: 2, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 25, independent conditional: 3, independent unconditional: 22, dependent: 50, dependent conditional: 2, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 231, independent: 120, independent conditional: 7, independent unconditional: 113, dependent: 111, dependent conditional: 8, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8116, independent: 2651, independent conditional: 0, independent unconditional: 2651, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 5460, unknown conditional: 5, unknown unconditional: 5455] , Statistics on independence cache: Total cache size (in pairs): 5460, Positive cache size: 5410, Positive conditional cache size: 3, Positive unconditional cache size: 5407, Negative cache size: 50, Negative conditional cache size: 2, Negative unconditional cache size: 48, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1, Independence queries for same thread: 556 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.4s, Number of persistent set computation: 514, Number of trivial persistent sets: 482, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7013, independent: 6965, independent conditional: 0, independent unconditional: 6965, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8667, independent: 8061, independent conditional: 1096, independent unconditional: 6965, dependent: 606, dependent conditional: 558, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8111, independent: 8061, independent conditional: 1096, independent unconditional: 6965, dependent: 50, dependent conditional: 2, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8111, independent: 8061, independent conditional: 1096, independent unconditional: 6965, dependent: 50, dependent conditional: 2, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8116, independent: 8061, independent conditional: 3, independent unconditional: 8058, dependent: 55, dependent conditional: 2, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8116, independent: 8061, independent conditional: 3, independent unconditional: 8058, dependent: 55, dependent conditional: 2, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8116, independent: 8061, independent conditional: 3, independent unconditional: 8058, dependent: 55, dependent conditional: 2, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5460, independent: 5410, independent conditional: 3, independent unconditional: 5407, dependent: 50, dependent conditional: 2, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5460, independent: 5385, independent conditional: 0, independent unconditional: 5385, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 75, independent: 25, independent conditional: 3, independent unconditional: 22, dependent: 50, dependent conditional: 2, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 25, independent conditional: 3, independent unconditional: 22, dependent: 50, dependent conditional: 2, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 231, independent: 120, independent conditional: 7, independent unconditional: 113, dependent: 111, dependent conditional: 8, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8116, independent: 2651, independent conditional: 0, independent unconditional: 2651, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 5460, unknown conditional: 5, unknown unconditional: 5455] , Statistics on independence cache: Total cache size (in pairs): 5460, Positive cache size: 5410, Positive conditional cache size: 3, Positive unconditional cache size: 5407, Negative cache size: 50, Negative conditional cache size: 2, Negative unconditional cache size: 48, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1, Independence queries for same thread: 556 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3490, independent: 3250, independent conditional: 153, independent unconditional: 3097, dependent: 240, dependent conditional: 230, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3260, independent: 3250, independent conditional: 153, independent unconditional: 3097, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3260, independent: 3250, independent conditional: 153, independent unconditional: 3097, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3260, independent: 3250, independent conditional: 0, independent unconditional: 3250, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3260, independent: 3250, independent conditional: 0, independent unconditional: 3250, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3260, independent: 3250, independent conditional: 0, independent unconditional: 3250, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2844, independent: 2834, independent conditional: 0, independent unconditional: 2834, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2844, independent: 2824, independent conditional: 0, independent unconditional: 2824, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 20, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 80, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3260, independent: 416, independent conditional: 0, independent unconditional: 416, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2844, unknown conditional: 0, unknown unconditional: 2844] , Statistics on independence cache: Total cache size (in pairs): 2844, Positive cache size: 2834, Positive conditional cache size: 0, Positive unconditional cache size: 2834, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 230 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 109, Number of trivial persistent sets: 102, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3107, independent: 3097, independent conditional: 0, independent unconditional: 3097, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3490, independent: 3250, independent conditional: 153, independent unconditional: 3097, dependent: 240, dependent conditional: 230, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3260, independent: 3250, independent conditional: 153, independent unconditional: 3097, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3260, independent: 3250, independent conditional: 153, independent unconditional: 3097, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3260, independent: 3250, independent conditional: 0, independent unconditional: 3250, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3260, independent: 3250, independent conditional: 0, independent unconditional: 3250, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3260, independent: 3250, independent conditional: 0, independent unconditional: 3250, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2844, independent: 2834, independent conditional: 0, independent unconditional: 2834, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2844, independent: 2824, independent conditional: 0, independent unconditional: 2824, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 20, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 80, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3260, independent: 416, independent conditional: 0, independent unconditional: 416, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2844, unknown conditional: 0, unknown unconditional: 2844] , Statistics on independence cache: Total cache size (in pairs): 2844, Positive cache size: 2834, Positive conditional cache size: 0, Positive unconditional cache size: 2834, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 230 - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown