/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 19:19:23,094 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 19:19:23,095 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 19:19:23,176 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 19:19:23,176 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 19:19:23,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 19:19:23,181 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 19:19:23,183 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 19:19:23,184 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 19:19:23,187 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 19:19:23,188 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 19:19:23,188 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 19:19:23,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 19:19:23,189 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 19:19:23,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 19:19:23,190 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 19:19:23,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 19:19:23,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 19:19:23,192 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 19:19:23,193 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 19:19:23,194 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 19:19:23,196 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 19:19:23,198 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 19:19:23,199 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 19:19:23,207 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 19:19:23,207 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 19:19:23,207 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 19:19:23,208 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 19:19:23,208 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 19:19:23,209 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 19:19:23,209 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 19:19:23,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 19:19:23,210 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 19:19:23,210 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 19:19:23,211 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 19:19:23,211 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 19:19:23,211 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 19:19:23,211 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 19:19:23,211 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 19:19:23,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 19:19:23,212 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 19:19:23,215 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 19:19:23,236 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 19:19:23,236 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 19:19:23,237 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 19:19:23,237 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 19:19:23,238 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 19:19:23,238 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 19:19:23,238 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 19:19:23,238 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 19:19:23,238 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 19:19:23,238 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 19:19:23,239 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 19:19:23,239 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 19:19:23,239 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 19:19:23,239 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 19:19:23,239 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 19:19:23,239 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 19:19:23,239 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 19:19:23,239 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 19:19:23,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 19:19:23,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 19:19:23,240 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 19:19:23,240 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 19:19:23,240 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 19:19:23,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:19:23,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 19:19:23,240 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 19:19:23,240 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 19:19:23,240 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 19:19:23,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 19:19:23,241 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 19:19:23,241 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 19:19:23,241 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 19:19:23,241 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 19:19:23,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 19:19:23,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 19:19:23,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 19:19:23,463 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 19:19:23,464 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 19:19:23,465 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c [2022-03-15 19:19:23,508 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd2303fa/7cee0922e0c5407f90cbe8dc8d0e0e5a/FLAG8043f3961 [2022-03-15 19:19:23,890 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 19:19:23,890 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c [2022-03-15 19:19:23,896 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd2303fa/7cee0922e0c5407f90cbe8dc8d0e0e5a/FLAG8043f3961 [2022-03-15 19:19:24,313 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd2303fa/7cee0922e0c5407f90cbe8dc8d0e0e5a [2022-03-15 19:19:24,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 19:19:24,316 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 19:19:24,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 19:19:24,317 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 19:19:24,319 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 19:19:24,320 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:19:24" (1/1) ... [2022-03-15 19:19:24,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a530873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:24, skipping insertion in model container [2022-03-15 19:19:24,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:19:24" (1/1) ... [2022-03-15 19:19:24,328 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 19:19:24,338 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 19:19:24,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c[3018,3031] [2022-03-15 19:19:24,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:19:24,542 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 19:19:24,570 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc.wvr.c[3018,3031] [2022-03-15 19:19:24,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:19:24,582 INFO L208 MainTranslator]: Completed translation [2022-03-15 19:19:24,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:24 WrapperNode [2022-03-15 19:19:24,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 19:19:24,583 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 19:19:24,583 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 19:19:24,583 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 19:19:24,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:24" (1/1) ... [2022-03-15 19:19:24,594 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:24" (1/1) ... [2022-03-15 19:19:24,608 INFO L137 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2022-03-15 19:19:24,609 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 19:19:24,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 19:19:24,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 19:19:24,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 19:19:24,616 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:24" (1/1) ... [2022-03-15 19:19:24,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:24" (1/1) ... [2022-03-15 19:19:24,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:24" (1/1) ... [2022-03-15 19:19:24,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:24" (1/1) ... [2022-03-15 19:19:24,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:24" (1/1) ... [2022-03-15 19:19:24,628 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:24" (1/1) ... [2022-03-15 19:19:24,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:24" (1/1) ... [2022-03-15 19:19:24,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 19:19:24,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 19:19:24,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 19:19:24,632 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 19:19:24,633 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:24" (1/1) ... [2022-03-15 19:19:24,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:19:24,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:19:24,653 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 19:19:24,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 19:19:24,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 19:19:24,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 19:19:24,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 19:19:24,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 19:19:24,678 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 19:19:24,678 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 19:19:24,678 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 19:19:24,678 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 19:19:24,679 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 19:19:24,679 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 19:19:24,679 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-03-15 19:19:24,679 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-03-15 19:19:24,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 19:19:24,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 19:19:24,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 19:19:24,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 19:19:24,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 19:19:24,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 19:19:24,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 19:19:24,680 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 19:19:24,741 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 19:19:24,742 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 19:19:25,074 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 19:19:25,153 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 19:19:25,154 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-15 19:19:25,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:19:25 BoogieIcfgContainer [2022-03-15 19:19:25,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 19:19:25,157 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 19:19:25,157 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 19:19:25,166 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 19:19:25,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 07:19:24" (1/3) ... [2022-03-15 19:19:25,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2699087e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:19:25, skipping insertion in model container [2022-03-15 19:19:25,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:19:24" (2/3) ... [2022-03-15 19:19:25,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2699087e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:19:25, skipping insertion in model container [2022-03-15 19:19:25,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:19:25" (3/3) ... [2022-03-15 19:19:25,169 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-min-max-inc.wvr.c [2022-03-15 19:19:25,172 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 19:19:25,172 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 19:19:25,172 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 19:19:25,172 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 19:19:25,228 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,228 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,228 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,229 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,229 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,229 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,229 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,229 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,229 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,229 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,229 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,230 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,230 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,230 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,230 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,230 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,230 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,230 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,230 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,230 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,231 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,231 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,231 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,231 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,231 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,231 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,231 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,231 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,232 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,232 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,232 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,232 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,232 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,232 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,232 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,232 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,232 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,233 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,233 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,233 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,233 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,233 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,233 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,233 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,233 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,233 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,234 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,234 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,234 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,234 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,234 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,234 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,234 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,234 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,235 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,235 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,235 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,235 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,235 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,235 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,235 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,235 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,235 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,235 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,236 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,236 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,236 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,236 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,236 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,236 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,236 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,237 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,237 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,237 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,237 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,237 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,237 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,237 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,237 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,237 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,237 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,238 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,238 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,238 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,238 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,238 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,238 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,238 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,238 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,238 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,238 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,239 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,239 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,239 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,239 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,239 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,239 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,239 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,240 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,240 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,253 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,253 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,253 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,253 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,253 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,253 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,254 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,254 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,254 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,254 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,255 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,255 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,255 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,255 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,255 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,255 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,255 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,255 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,256 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,256 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,256 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,256 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,256 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,256 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,256 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,256 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,256 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:19:25,259 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-03-15 19:19:25,295 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 19:19:25,300 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 19:19:25,300 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-03-15 19:19:25,312 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 19:19:25,319 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 172 transitions, 376 flow [2022-03-15 19:19:25,324 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 172 transitions, 376 flow [2022-03-15 19:19:25,326 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 173 places, 172 transitions, 376 flow [2022-03-15 19:19:25,391 INFO L129 PetriNetUnfolder]: 12/168 cut-off events. [2022-03-15 19:19:25,392 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-03-15 19:19:25,395 INFO L84 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 168 events. 12/168 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 115 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2022-03-15 19:19:25,398 INFO L116 LiptonReduction]: Number of co-enabled transitions 2280 [2022-03-15 19:19:30,459 INFO L131 LiptonReduction]: Checked pairs total: 3643 [2022-03-15 19:19:30,459 INFO L133 LiptonReduction]: Total number of compositions: 152 [2022-03-15 19:19:30,466 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 36 transitions, 104 flow [2022-03-15 19:19:30,524 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 397 states, 396 states have (on average 3.7222222222222223) internal successors, (1474), 396 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:19:30,527 INFO L276 IsEmpty]: Start isEmpty. Operand has 397 states, 396 states have (on average 3.7222222222222223) internal successors, (1474), 396 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:19:30,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:19:30,537 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:19:30,537 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:19:30,537 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:19:30,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:19:30,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1518113902, now seen corresponding path program 1 times [2022-03-15 19:19:30,555 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:19:30,556 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999429895] [2022-03-15 19:19:30,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:19:30,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:19:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:30,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:19:30,706 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:19:30,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999429895] [2022-03-15 19:19:30,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999429895] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:19:30,706 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:19:30,707 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:19:30,707 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1482893601] [2022-03-15 19:19:30,708 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:19:30,713 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:19:30,788 INFO L252 McrAutomatonBuilder]: Finished intersection with 134 states and 296 transitions. [2022-03-15 19:19:30,789 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:19:31,466 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [974#(< thread1Thread1of1ForFork0_~i~0 ~N~0)] [2022-03-15 19:19:31,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 19:19:31,468 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:19:31,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 19:19:31,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:19:31,484 INFO L87 Difference]: Start difference. First operand has 397 states, 396 states have (on average 3.7222222222222223) internal successors, (1474), 396 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:19:31,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:19:31,556 INFO L93 Difference]: Finished difference Result 479 states and 1790 transitions. [2022-03-15 19:19:31,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:19:31,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 19:19:31,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:19:31,572 INFO L225 Difference]: With dead ends: 479 [2022-03-15 19:19:31,572 INFO L226 Difference]: Without dead ends: 479 [2022-03-15 19:19:31,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:19:31,575 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:19:31,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 3 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:19:31,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-03-15 19:19:31,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2022-03-15 19:19:31,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 478 states have (on average 3.7447698744769875) internal successors, (1790), 478 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:19:31,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1790 transitions. [2022-03-15 19:19:31,638 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1790 transitions. Word has length 27 [2022-03-15 19:19:31,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:19:31,638 INFO L470 AbstractCegarLoop]: Abstraction has 479 states and 1790 transitions. [2022-03-15 19:19:31,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:19:31,638 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1790 transitions. [2022-03-15 19:19:31,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:19:31,644 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:19:31,644 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:19:31,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 19:19:31,645 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:19:31,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:19:31,647 INFO L85 PathProgramCache]: Analyzing trace with hash 495859718, now seen corresponding path program 1 times [2022-03-15 19:19:31,648 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:19:31,651 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626230041] [2022-03-15 19:19:31,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:19:31,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:19:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:31,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:19:31,760 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:19:31,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626230041] [2022-03-15 19:19:31,760 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626230041] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:19:31,760 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:19:31,760 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:19:31,760 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [644752176] [2022-03-15 19:19:31,761 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:19:31,764 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:19:31,786 INFO L252 McrAutomatonBuilder]: Finished intersection with 116 states and 250 transitions. [2022-03-15 19:19:31,787 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:19:32,338 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [2416#(< |thread3Thread1of1ForFork3_~i~2#1| ~N~0)] [2022-03-15 19:19:32,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 19:19:32,339 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:19:32,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 19:19:32,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:19:32,339 INFO L87 Difference]: Start difference. First operand 479 states and 1790 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:19:32,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:19:32,412 INFO L93 Difference]: Finished difference Result 619 states and 2336 transitions. [2022-03-15 19:19:32,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:19:32,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 19:19:32,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:19:32,416 INFO L225 Difference]: With dead ends: 619 [2022-03-15 19:19:32,416 INFO L226 Difference]: Without dead ends: 619 [2022-03-15 19:19:32,416 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 79 SyntacticMatches, 8 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:19:32,417 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:19:32,417 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 1 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:19:32,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-03-15 19:19:32,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2022-03-15 19:19:32,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 618 states have (on average 3.779935275080906) internal successors, (2336), 618 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:19:32,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 2336 transitions. [2022-03-15 19:19:32,437 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 2336 transitions. Word has length 28 [2022-03-15 19:19:32,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:19:32,438 INFO L470 AbstractCegarLoop]: Abstraction has 619 states and 2336 transitions. [2022-03-15 19:19:32,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:19:32,438 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 2336 transitions. [2022-03-15 19:19:32,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:19:32,440 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:19:32,440 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:19:32,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 19:19:32,440 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:19:32,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:19:32,441 INFO L85 PathProgramCache]: Analyzing trace with hash -816633427, now seen corresponding path program 1 times [2022-03-15 19:19:32,442 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:19:32,442 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102363924] [2022-03-15 19:19:32,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:19:32,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:19:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:32,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:19:32,511 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:19:32,511 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102363924] [2022-03-15 19:19:32,511 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102363924] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:19:32,511 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:19:32,511 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:19:32,512 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1676485673] [2022-03-15 19:19:32,512 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:19:32,516 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:19:32,565 INFO L252 McrAutomatonBuilder]: Finished intersection with 94 states and 183 transitions. [2022-03-15 19:19:32,565 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:19:32,592 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2022-03-15 19:19:32,699 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2022-03-15 19:19:33,047 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:19:33,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:19:33,048 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:19:33,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:19:33,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:19:33,049 INFO L87 Difference]: Start difference. First operand 619 states and 2336 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:19:33,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:19:33,107 INFO L93 Difference]: Finished difference Result 765 states and 2902 transitions. [2022-03-15 19:19:33,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:19:33,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 19:19:33,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:19:33,111 INFO L225 Difference]: With dead ends: 765 [2022-03-15 19:19:33,111 INFO L226 Difference]: Without dead ends: 765 [2022-03-15 19:19:33,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 13 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:19:33,114 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 18 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:19:33,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 3 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:19:33,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2022-03-15 19:19:33,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 765. [2022-03-15 19:19:33,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 764 states have (on average 3.798429319371728) internal successors, (2902), 764 states have internal predecessors, (2902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:19:33,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 2902 transitions. [2022-03-15 19:19:33,133 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 2902 transitions. Word has length 29 [2022-03-15 19:19:33,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:19:33,135 INFO L470 AbstractCegarLoop]: Abstraction has 765 states and 2902 transitions. [2022-03-15 19:19:33,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:19:33,135 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 2902 transitions. [2022-03-15 19:19:33,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:19:33,137 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:19:33,137 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:19:33,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 19:19:33,138 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:19:33,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:19:33,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1145689008, now seen corresponding path program 1 times [2022-03-15 19:19:33,139 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:19:33,141 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970564077] [2022-03-15 19:19:33,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:19:33,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:19:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:33,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:19:33,213 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:19:33,213 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970564077] [2022-03-15 19:19:33,214 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970564077] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:19:33,214 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:19:33,215 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 19:19:33,215 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [93087307] [2022-03-15 19:19:33,215 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:19:33,221 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:19:33,250 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 151 transitions. [2022-03-15 19:19:33,251 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:19:33,469 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:19:33,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 19:19:33,473 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:19:33,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 19:19:33,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:19:33,474 INFO L87 Difference]: Start difference. First operand 765 states and 2902 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:19:33,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:19:33,514 INFO L93 Difference]: Finished difference Result 766 states and 2903 transitions. [2022-03-15 19:19:33,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:19:33,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:19:33,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:19:33,518 INFO L225 Difference]: With dead ends: 766 [2022-03-15 19:19:33,518 INFO L226 Difference]: Without dead ends: 766 [2022-03-15 19:19:33,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:19:33,519 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:19:33,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:19:33,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2022-03-15 19:19:33,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 766. [2022-03-15 19:19:33,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 765 states have (on average 3.794771241830065) internal successors, (2903), 765 states have internal predecessors, (2903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:19:33,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 2903 transitions. [2022-03-15 19:19:33,537 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 2903 transitions. Word has length 30 [2022-03-15 19:19:33,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:19:33,537 INFO L470 AbstractCegarLoop]: Abstraction has 766 states and 2903 transitions. [2022-03-15 19:19:33,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:19:33,537 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 2903 transitions. [2022-03-15 19:19:33,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:19:33,540 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:19:33,540 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:19:33,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 19:19:33,540 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:19:33,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:19:33,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1033206893, now seen corresponding path program 1 times [2022-03-15 19:19:33,544 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:19:33,544 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732901517] [2022-03-15 19:19:33,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:19:33,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:19:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:33,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:19:33,707 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:19:33,707 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732901517] [2022-03-15 19:19:33,708 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732901517] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:19:33,708 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:19:33,708 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 19:19:33,708 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1253771299] [2022-03-15 19:19:33,708 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:19:33,712 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:19:33,732 INFO L252 McrAutomatonBuilder]: Finished intersection with 83 states and 152 transitions. [2022-03-15 19:19:33,732 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:19:34,183 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [8878#(= (mod ~b2~0 256) 0)] [2022-03-15 19:19:34,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 19:19:34,184 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:19:34,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 19:19:34,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:19:34,184 INFO L87 Difference]: Start difference. First operand 766 states and 2903 transitions. Second operand has 5 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:19:34,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:19:34,274 INFO L93 Difference]: Finished difference Result 921 states and 3414 transitions. [2022-03-15 19:19:34,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:19:34,274 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:19:34,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:19:34,278 INFO L225 Difference]: With dead ends: 921 [2022-03-15 19:19:34,278 INFO L226 Difference]: Without dead ends: 670 [2022-03-15 19:19:34,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:19:34,278 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 29 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:19:34,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 5 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:19:34,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-03-15 19:19:34,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2022-03-15 19:19:34,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 669 states have (on average 3.705530642750374) internal successors, (2479), 669 states have internal predecessors, (2479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:19:34,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 2479 transitions. [2022-03-15 19:19:34,291 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 2479 transitions. Word has length 31 [2022-03-15 19:19:34,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:19:34,291 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 2479 transitions. [2022-03-15 19:19:34,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:19:34,291 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 2479 transitions. [2022-03-15 19:19:34,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:19:34,293 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:19:34,293 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:19:34,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 19:19:34,293 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:19:34,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:19:34,294 INFO L85 PathProgramCache]: Analyzing trace with hash -889289885, now seen corresponding path program 2 times [2022-03-15 19:19:34,294 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:19:34,294 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601202748] [2022-03-15 19:19:34,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:19:34,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:19:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:19:34,476 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:19:34,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601202748] [2022-03-15 19:19:34,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601202748] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:19:34,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470281335] [2022-03-15 19:19:34,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:19:34,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:19:34,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:19:34,492 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:19:34,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 19:19:34,608 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:19:34,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:19:34,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 19:19:34,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:19:34,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:19:34,774 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 19:19:34,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:19:34,808 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 19:19:34,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:19:34,842 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 19:19:34,904 INFO L387 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 28 treesize of output 16 [2022-03-15 19:19:34,951 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-03-15 19:19:34,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:19:34,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:19:35,189 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_215 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_215) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483646 .cse0) (<= c_~min~0 (+ .cse0 2))))) is different from false [2022-03-15 19:19:35,208 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_215 (Array Int Int)) (v_ArrVal_214 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_215) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483646 .cse0) (<= c_~min~0 (+ 2 .cse0))))) is different from false [2022-03-15 19:19:35,221 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_215 (Array Int Int)) (v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_215) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 2)) (<= 2147483646 .cse0)))) is different from false [2022-03-15 19:19:35,275 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_215 (Array Int Int)) (v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse3 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_215) c_~A~0.base) c_~A~0.offset))) (or (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (let ((.cse0 (< c_~min~0 .cse2)) (.cse1 (+ .cse3 2))) (and (or (not .cse0) (<= c_~min~0 .cse1)) (or .cse0 (<= .cse2 .cse1))))) (<= 2147483646 .cse3)))) is different from false [2022-03-15 19:19:35,300 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_215 (Array Int Int)) (v_ArrVal_214 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse3 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_215) c_~A~0.base) c_~A~0.offset))) (or (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse1 (< c_~min~0 .cse2)) (.cse0 (+ .cse3 2))) (and (or (<= c_~min~0 .cse0) (not .cse1)) (or .cse1 (<= .cse2 .cse0))))) (<= 2147483646 .cse3)))) is different from false [2022-03-15 19:19:35,307 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1091 treesize of output 963 [2022-03-15 19:19:35,321 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 947 treesize of output 931 [2022-03-15 19:19:35,327 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 931 treesize of output 867 [2022-03-15 19:19:35,334 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 867 treesize of output 835 [2022-03-15 19:19:43,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-03-15 19:19:43,409 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470281335] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:19:43,409 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:19:43,409 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 13] total 32 [2022-03-15 19:19:43,410 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [104954097] [2022-03-15 19:19:43,410 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:19:43,415 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:19:43,436 INFO L252 McrAutomatonBuilder]: Finished intersection with 89 states and 169 transitions. [2022-03-15 19:19:43,436 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:19:43,908 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:19:43,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:19:43,908 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:19:43,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:19:43,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=677, Unknown=5, NotChecked=290, Total=1122 [2022-03-15 19:19:43,909 INFO L87 Difference]: Start difference. First operand 670 states and 2479 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:19:44,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:19:44,356 INFO L93 Difference]: Finished difference Result 2110 states and 7913 transitions. [2022-03-15 19:19:44,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:19:44,356 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:19:44,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:19:44,362 INFO L225 Difference]: With dead ends: 2110 [2022-03-15 19:19:44,362 INFO L226 Difference]: Without dead ends: 1128 [2022-03-15 19:19:44,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 86 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=267, Invalid=1154, Unknown=5, NotChecked=380, Total=1806 [2022-03-15 19:19:44,363 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 175 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:19:44,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 17 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:19:44,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2022-03-15 19:19:44,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 670. [2022-03-15 19:19:44,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 669 states have (on average 3.6517189835575485) internal successors, (2443), 669 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:19:44,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 2443 transitions. [2022-03-15 19:19:44,385 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 2443 transitions. Word has length 31 [2022-03-15 19:19:44,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:19:44,386 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 2443 transitions. [2022-03-15 19:19:44,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:19:44,386 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 2443 transitions. [2022-03-15 19:19:44,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:19:44,388 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:19:44,388 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:19:44,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 19:19:44,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-03-15 19:19:44,606 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:19:44,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:19:44,608 INFO L85 PathProgramCache]: Analyzing trace with hash -512145345, now seen corresponding path program 3 times [2022-03-15 19:19:44,609 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:19:44,609 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620350126] [2022-03-15 19:19:44,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:19:44,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:19:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:44,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:19:44,816 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:19:44,816 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620350126] [2022-03-15 19:19:44,816 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620350126] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:19:44,816 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625427304] [2022-03-15 19:19:44,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:19:44,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:19:44,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:19:44,819 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:19:44,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 19:19:45,000 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:19:45,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:19:45,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 40 conjunts are in the unsatisfiable core [2022-03-15 19:19:45,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:19:45,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:19:45,171 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 19:19:45,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:19:45,212 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 19:19:45,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:19:45,243 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 19:19:45,346 INFO L387 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 35 treesize of output 19 [2022-03-15 19:19:45,416 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2022-03-15 19:19:45,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:19:45,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:19:45,954 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_284 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_284) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483646 .cse0) (<= c_~min~0 (+ .cse0 2))))) (= (mod c_~b1~0 256) 0)) is different from false [2022-03-15 19:19:45,968 WARN L838 $PredicateComparison]: unable to prove that (or (= (mod c_~b1~0 256) 0) (forall ((v_ArrVal_283 (Array Int Int)) (v_ArrVal_284 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_284) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483646 .cse0) (<= c_~min~0 (+ 2 .cse0)))))) is different from false [2022-03-15 19:19:45,984 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_283 (Array Int Int)) (v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_282) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_284) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483646 .cse0) (<= c_~min~0 (+ 2 .cse0))))) (= (mod c_~b1~0 256) 0)) is different from false [2022-03-15 19:19:46,040 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_283 (Array Int Int)) (v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 (Array Int Int))) (let ((.cse3 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_282) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_284) c_~A~0.base) c_~A~0.offset))) (or (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (let ((.cse0 (< c_~min~0 .cse2)) (.cse1 (+ 2 .cse3))) (and (or (not .cse0) (<= c_~min~0 .cse1)) (or .cse0 (<= .cse2 .cse1))))) (<= 2147483646 .cse3)))) (= (mod c_~b1~0 256) 0)) is different from false [2022-03-15 19:19:46,065 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array Int Int)) (v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 (Array Int Int))) (let ((.cse3 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_282) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_284) c_~A~0.base) c_~A~0.offset))) (or (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse2 (< c_~min~0 .cse0)) (.cse1 (+ 2 .cse3))) (and (or (<= .cse0 .cse1) .cse2) (or (not .cse2) (<= c_~min~0 .cse1))))) (<= 2147483646 .cse3)))) is different from false [2022-03-15 19:19:46,070 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1091 treesize of output 963 [2022-03-15 19:19:46,084 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 947 treesize of output 915 [2022-03-15 19:19:46,090 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 915 treesize of output 851 [2022-03-15 19:19:46,099 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 435 treesize of output 419 [2022-03-15 19:19:50,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-03-15 19:19:50,845 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625427304] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:19:50,845 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:19:50,845 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 14] total 34 [2022-03-15 19:19:50,845 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1863722910] [2022-03-15 19:19:50,845 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:19:50,849 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:19:50,882 INFO L252 McrAutomatonBuilder]: Finished intersection with 93 states and 181 transitions. [2022-03-15 19:19:50,882 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:19:51,521 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [15040#(or (<= 2147483647 ~max~0) (<= ~min~0 (+ ~max~0 1)))] [2022-03-15 19:19:51,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:19:51,521 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:19:51,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:19:51,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=814, Unknown=5, NotChecked=320, Total=1332 [2022-03-15 19:19:51,522 INFO L87 Difference]: Start difference. First operand 670 states and 2443 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:19:51,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:19:51,826 INFO L93 Difference]: Finished difference Result 1211 states and 4506 transitions. [2022-03-15 19:19:51,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:19:51,826 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:19:51,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:19:51,830 INFO L225 Difference]: With dead ends: 1211 [2022-03-15 19:19:51,830 INFO L226 Difference]: Without dead ends: 670 [2022-03-15 19:19:51,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=313, Invalid=1262, Unknown=5, NotChecked=400, Total=1980 [2022-03-15 19:19:51,831 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 168 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:19:51,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 15 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:19:51,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-03-15 19:19:51,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 582. [2022-03-15 19:19:51,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 581 states have (on average 3.7091222030981066) internal successors, (2155), 581 states have internal predecessors, (2155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:19:51,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 2155 transitions. [2022-03-15 19:19:51,844 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 2155 transitions. Word has length 31 [2022-03-15 19:19:51,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:19:51,844 INFO L470 AbstractCegarLoop]: Abstraction has 582 states and 2155 transitions. [2022-03-15 19:19:51,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:19:51,844 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 2155 transitions. [2022-03-15 19:19:51,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:19:51,846 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:19:51,846 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:19:51,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 19:19:52,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-03-15 19:19:52,065 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:19:52,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:19:52,065 INFO L85 PathProgramCache]: Analyzing trace with hash 522803619, now seen corresponding path program 4 times [2022-03-15 19:19:52,066 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:19:52,066 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171958924] [2022-03-15 19:19:52,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:19:52,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:19:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:19:52,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:19:52,183 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:19:52,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171958924] [2022-03-15 19:19:52,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171958924] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:19:52,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812004492] [2022-03-15 19:19:52,183 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:19:52,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:19:52,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:19:52,184 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:19:52,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 19:19:52,274 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:19:52,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:19:52,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 19:19:52,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:19:52,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:19:52,356 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 19:19:52,471 INFO L387 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 35 treesize of output 19 [2022-03-15 19:19:52,522 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2022-03-15 19:19:52,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:19:52,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:19:52,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:19:52,984 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812004492] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:19:52,984 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:19:52,984 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 11] total 25 [2022-03-15 19:19:52,984 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [751542685] [2022-03-15 19:19:52,984 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:19:52,988 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:19:53,018 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 231 transitions. [2022-03-15 19:19:53,018 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:19:59,206 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [17649#(and (or (<= 2147483646 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2)) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)) (or (not (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (<= 2147483647 ~max~0) (<= ~min~0 (+ ~max~0 1)) (<= ~max~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (or (<= ~min~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2)) (<= 2147483646 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) ~min~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max~0 1)) (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= 2147483647 ~max~0) (<= ~max~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)))), 17640#(and (or (<= ~min~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2)) (<= 2147483646 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)) (or (<= 2147483647 ~max~0) (<= ~min~0 (+ ~max~0 1)) (<= ~max~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)))), 17639#(and (or (<= 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= 2147483647 ~max~0) (<= ~min~0 (+ ~max~0 1)) (<= ~max~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)))) (or (<= ~min~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2)) (<= 2147483646 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~max~0) (<= ~min~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) 1))) (or (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~max~0) (<= ~min~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) 1)) (<= 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= (* thread2Thread1of1ForFork2_~i~1 4) 0))), 17641#(and (or (not (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (<= 2147483647 ~max~0) (<= ~min~0 (+ ~max~0 1)) (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4)))) (<= ~max~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)))) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) 1)) (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4))) 2)) (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~max~0) (<= 2147483646 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4))))) (or (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset))) (= (* thread2Thread1of1ForFork2_~i~1 4) (* |thread3Thread1of1ForFork3_~i~2#1| 4)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~max~0) (<= ~min~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) 1)) (not (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4))))) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) 1)) (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset))) (= (* thread2Thread1of1ForFork2_~i~1 4) (* |thread3Thread1of1ForFork3_~i~2#1| 4)) (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~max~0) (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4))))) (or (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~max~0) (<= ~min~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) 1)) (<= ~min~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4))) 2)) (<= 2147483646 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) ~min~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max~0 1)) (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= 2147483647 ~max~0) (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4)))) (<= ~max~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset))))), 17642#(and (or (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset))) (= (* thread2Thread1of1ForFork2_~i~1 4) (* |thread3Thread1of1ForFork3_~i~2#1| 4)) (not (< ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~max~0) (<= ~min~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) 1)) (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4))))) (or (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~max~0) (< ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) 1)) (<= 2147483646 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4))) 2))) (or (not (< ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= 2147483647 ~max~0) (<= ~min~0 (+ ~max~0 1)) (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4)))) (<= ~max~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)))) (or (< ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= 2147483647 ~max~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~max~0 1)) (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4)))) (<= ~max~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)))) (or (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset))) (= (* thread2Thread1of1ForFork2_~i~1 4) (* |thread3Thread1of1ForFork3_~i~2#1| 4)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~max~0) (< ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) 1)) (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4))))) (or (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~max~0) (<= ~min~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) 1)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min~0) (<= ~min~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4))) 2)) (<= 2147483646 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4)))))), 17644#(and (or (<= 2147483647 ~max~0) (<= ~min~0 (+ ~max~0 1)) (<= ~max~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4))))) (or (<= 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= ~min~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4))) 2)) (<= 2147483646 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4)))) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (<= ~min~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1))) (or (<= 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= (* |thread3Thread1of1ForFork3_~i~2#1| 4) 0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4)))) (<= ~min~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)))), 17648#(and (or (<= 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~max~0 1)) (<= ~max~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~max~0) (<= 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) 1)))), 17646#(and (or (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~max~0) (<= ~min~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) 1)) (<= 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (= (* thread2Thread1of1ForFork2_~i~1 4) 0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) 1)) (<= 2147483646 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset))) (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~max~0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2))) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) 1)) (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset))) (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~max~0) (<= 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= (* thread2Thread1of1ForFork2_~i~1 4) 0)) (or (<= 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (<= 2147483647 ~max~0) (<= ~min~0 (+ ~max~0 1)) (<= ~max~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)))) (or (<= ~min~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2)) (<= 2147483646 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~max~0) (<= ~min~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) 1)) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) ~min~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max~0 1)) (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= 2147483647 ~max~0) (<= ~max~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset))))), 17643#(and (or (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset))) (= (* thread2Thread1of1ForFork2_~i~1 4) (* |thread3Thread1of1ForFork3_~i~2#1| 4)) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~max~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) 1)) (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4))))) (or (<= 2147483647 ~max~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~max~0 1)) (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4)))) (<= ~max~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)))) (or (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~max~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) 1)) (<= 2147483646 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4)))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4))) 2)))), 17638#(and (or (<= 2147483647 ~max~0) (<= ~min~0 (+ ~max~0 1)) (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4)))) (<= ~max~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)))) (or (and (= (* thread2Thread1of1ForFork2_~i~1 4) (* |thread3Thread1of1ForFork3_~i~2#1| 4)) (<= ~min~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4))) 2))) (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~max~0) (<= ~min~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) 1)) (and (= (* thread2Thread1of1ForFork2_~i~1 4) (* |thread3Thread1of1ForFork3_~i~2#1| 4)) (<= 2147483646 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4))))) (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4)))))), 17645#(and (or (not (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (<= 2147483647 ~max~0) (<= ~min~0 (+ ~max~0 1)) (<= ~max~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4))))) (or (<= 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= ~min~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4))) 2)) (<= 2147483646 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4)))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) ~min~0) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (<= ~min~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1))) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max~0 1)) (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= 2147483647 ~max~0) (<= ~max~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4))))) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4))) 2)) (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)) (<= 2147483646 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4)))) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)) (or (<= 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= (* |thread3Thread1of1ForFork3_~i~2#1| 4) 0) (not (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4)))) (<= ~min~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1))) (or (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= (* |thread3Thread1of1ForFork3_~i~2#1| 4) 0) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)) (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0) (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4)))))), 17647#(and (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~max~0) (<= ~min~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) 1)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min~0) (<= 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (or (<= 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~max~0 1)) (<= ~max~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)))) (or (not (< ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= ~min~0 (+ ~max~0 1)) (<= ~max~0 (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) ~max~0) (<= 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ (select (select |#memory_int| ~A~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~A~0.offset)) 1))))] [2022-03-15 19:19:59,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:19:59,207 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:19:59,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:19:59,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1181, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:19:59,207 INFO L87 Difference]: Start difference. First operand 582 states and 2155 transitions. Second operand has 20 states, 19 states have (on average 5.157894736842105) internal successors, (98), 20 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) [2022-03-15 19:20:02,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:20:02,582 INFO L93 Difference]: Finished difference Result 4340 states and 16208 transitions. [2022-03-15 19:20:02,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 19:20:02,583 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 5.157894736842105) internal successors, (98), 20 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) Word has length 31 [2022-03-15 19:20:02,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:20:02,607 INFO L225 Difference]: With dead ends: 4340 [2022-03-15 19:20:02,608 INFO L226 Difference]: Without dead ends: 3766 [2022-03-15 19:20:02,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 126 SyntacticMatches, 7 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1153 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=720, Invalid=3062, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 19:20:02,609 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 513 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 438 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:20:02,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [513 Valid, 51 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1035 Invalid, 0 Unknown, 438 Unchecked, 0.9s Time] [2022-03-15 19:20:02,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3766 states. [2022-03-15 19:20:02,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3766 to 1007. [2022-03-15 19:20:02,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 1006 states have (on average 3.8658051689860833) internal successors, (3889), 1006 states have internal predecessors, (3889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:02,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 3889 transitions. [2022-03-15 19:20:02,666 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 3889 transitions. Word has length 31 [2022-03-15 19:20:02,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:20:02,667 INFO L470 AbstractCegarLoop]: Abstraction has 1007 states and 3889 transitions. [2022-03-15 19:20:02,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.157894736842105) internal successors, (98), 20 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) [2022-03-15 19:20:02,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 3889 transitions. [2022-03-15 19:20:02,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:20:02,670 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:02,670 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:20:02,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 19:20:02,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:02,875 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:20:02,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:02,876 INFO L85 PathProgramCache]: Analyzing trace with hash 281997109, now seen corresponding path program 5 times [2022-03-15 19:20:02,877 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:02,877 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988485843] [2022-03-15 19:20:02,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:02,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:03,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:20:03,003 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:03,003 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988485843] [2022-03-15 19:20:03,003 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988485843] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:20:03,003 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222725747] [2022-03-15 19:20:03,003 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:20:03,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:03,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:20:03,005 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:20:03,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 19:20:03,117 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:20:03,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:20:03,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 19:20:03,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:20:03,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:20:03,222 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 19:20:03,296 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-03-15 19:20:03,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:20:03,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:20:03,544 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_418 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_418) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1))) (<= 2147483647 c_~max~0)) is different from false [2022-03-15 19:20:03,552 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-03-15 19:20:03,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:20:03,563 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222725747] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:20:03,563 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:20:03,563 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 22 [2022-03-15 19:20:03,563 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2137774420] [2022-03-15 19:20:03,564 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:20:03,567 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:20:03,595 INFO L252 McrAutomatonBuilder]: Finished intersection with 114 states and 243 transitions. [2022-03-15 19:20:03,595 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:04,446 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:20:04,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:20:04,447 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:04,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:20:04,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=413, Unknown=1, NotChecked=42, Total=552 [2022-03-15 19:20:04,447 INFO L87 Difference]: Start difference. First operand 1007 states and 3889 transitions. Second operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:04,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:20:04,775 INFO L93 Difference]: Finished difference Result 1264 states and 4758 transitions. [2022-03-15 19:20:04,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 19:20:04,775 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:20:04,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:20:04,783 INFO L225 Difference]: With dead ends: 1264 [2022-03-15 19:20:04,783 INFO L226 Difference]: Without dead ends: 1101 [2022-03-15 19:20:04,783 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 114 SyntacticMatches, 10 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=718, Unknown=1, NotChecked=56, Total=930 [2022-03-15 19:20:04,785 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 69 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:20:04,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 28 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 274 Invalid, 0 Unknown, 69 Unchecked, 0.2s Time] [2022-03-15 19:20:04,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2022-03-15 19:20:04,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1048. [2022-03-15 19:20:04,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 1047 states have (on average 3.8471824259789877) internal successors, (4028), 1047 states have internal predecessors, (4028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:04,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 4028 transitions. [2022-03-15 19:20:04,811 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 4028 transitions. Word has length 31 [2022-03-15 19:20:04,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:20:04,811 INFO L470 AbstractCegarLoop]: Abstraction has 1048 states and 4028 transitions. [2022-03-15 19:20:04,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:04,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 4028 transitions. [2022-03-15 19:20:04,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:20:04,814 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:04,814 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:20:04,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 19:20:05,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:05,028 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:20:05,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:05,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1011338709, now seen corresponding path program 6 times [2022-03-15 19:20:05,029 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:05,029 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543828527] [2022-03-15 19:20:05,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:05,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:05,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:20:05,168 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:05,169 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543828527] [2022-03-15 19:20:05,169 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543828527] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:20:05,169 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954566020] [2022-03-15 19:20:05,169 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:20:05,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:05,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:20:05,170 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:20:05,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 19:20:05,434 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 19:20:05,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:20:05,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 19:20:05,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:20:05,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:20:05,509 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 19:20:05,597 INFO L387 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 35 treesize of output 19 [2022-03-15 19:20:05,619 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-03-15 19:20:05,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:20:05,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:20:05,923 WARN L838 $PredicateComparison]: unable to prove that (or (<= 2147483647 c_~max~0) (forall ((v_ArrVal_483 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_483) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1)))) is different from false [2022-03-15 19:20:05,931 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-03-15 19:20:05,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:20:05,953 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954566020] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:20:05,953 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:20:05,953 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8, 10] total 25 [2022-03-15 19:20:05,953 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [217195203] [2022-03-15 19:20:05,953 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:20:05,957 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:20:05,982 INFO L252 McrAutomatonBuilder]: Finished intersection with 108 states and 219 transitions. [2022-03-15 19:20:05,982 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:08,655 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [27869#(or (<= 2147483647 ~max~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~max~0 1)) (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4))))), 27865#(and (or (and (= (* thread1Thread1of1ForFork0_~i~0 4) (* |thread3Thread1of1ForFork3_~i~2#1| 4)) (< ~min~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4))) 1))) (and (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max~0 1)) (not (= (* thread1Thread1of1ForFork0_~i~0 4) (* |thread3Thread1of1ForFork3_~i~2#1| 4)))) (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= 2147483647 ~max~0) (and (= (* thread1Thread1of1ForFork0_~i~0 4) (* |thread3Thread1of1ForFork3_~i~2#1| 4)) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4))) ~max~0)) (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4))))) (or (and (not (= (* thread1Thread1of1ForFork0_~i~0 4) (* |thread3Thread1of1ForFork3_~i~2#1| 4))) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) ~min~0)) (and (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4))) 1) ~min~0) (= (* thread1Thread1of1ForFork0_~i~0 4) (* |thread3Thread1of1ForFork3_~i~2#1| 4))) (<= 2147483647 ~max~0) (<= ~min~0 (+ ~max~0 1)) (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4)))))), 27868#(and (or (< ~min~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)) (not (= (* thread1Thread1of1ForFork0_~i~0 4) 0)) (<= 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)) (or (<= 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= 2147483647 ~max~0) (<= ~min~0 (+ ~max~0 1)) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) ~min~0)) (or (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max~0 1)) (< ~min~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= 2147483647 ~max~0))), 27871#(or (<= 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~max~0 1))), 27866#(and (or (not (< ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= 2147483647 ~max~0) (<= ~min~0 (+ ~max~0 1))) (or (< ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= 2147483647 ~max~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~max~0 1)))), 27867#(and (or (< ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= 2147483647 ~max~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~max~0 1)) (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4))))) (or (< ~min~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4))) 1)) (<= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4))) ~max~0) (not (= (* |thread3Thread1of1ForFork3_~i~2#1| 4) 0)) (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4))))) (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min~0) (<= 2147483647 ~max~0) (<= ~min~0 (+ ~max~0 1)) (<= 2147483647 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* |thread3Thread1of1ForFork3_~i~2#1| 4)))))), 27870#(and (or (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~min~0) (<= 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= ~min~0 (+ ~max~0 1))) (or (<= 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< ~min~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~max~0 1))) (or (< ~min~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)) (<= 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)))] [2022-03-15 19:20:08,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:20:08,657 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:08,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:20:08,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=870, Unknown=1, NotChecked=62, Total=1122 [2022-03-15 19:20:08,658 INFO L87 Difference]: Start difference. First operand 1048 states and 4028 transitions. Second operand has 18 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:09,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:20:09,149 INFO L93 Difference]: Finished difference Result 2023 states and 7720 transitions. [2022-03-15 19:20:09,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 19:20:09,150 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:20:09,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:20:09,158 INFO L225 Difference]: With dead ends: 2023 [2022-03-15 19:20:09,158 INFO L226 Difference]: Without dead ends: 1784 [2022-03-15 19:20:09,158 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 98 SyntacticMatches, 9 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=280, Invalid=1363, Unknown=1, NotChecked=78, Total=1722 [2022-03-15 19:20:09,159 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 82 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 200 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:20:09,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 21 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 423 Invalid, 0 Unknown, 200 Unchecked, 0.2s Time] [2022-03-15 19:20:09,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2022-03-15 19:20:09,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1520. [2022-03-15 19:20:09,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 1519 states have (on average 3.8551678736010535) internal successors, (5856), 1519 states have internal predecessors, (5856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:09,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 5856 transitions. [2022-03-15 19:20:09,188 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 5856 transitions. Word has length 31 [2022-03-15 19:20:09,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:20:09,189 INFO L470 AbstractCegarLoop]: Abstraction has 1520 states and 5856 transitions. [2022-03-15 19:20:09,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:09,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 5856 transitions. [2022-03-15 19:20:09,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:20:09,192 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:09,192 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:20:09,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 19:20:09,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-15 19:20:09,412 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:20:09,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:09,412 INFO L85 PathProgramCache]: Analyzing trace with hash -34824907, now seen corresponding path program 7 times [2022-03-15 19:20:09,412 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:09,412 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096437689] [2022-03-15 19:20:09,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:09,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:09,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:20:09,536 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:09,536 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096437689] [2022-03-15 19:20:09,536 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096437689] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:20:09,536 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506972118] [2022-03-15 19:20:09,536 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:20:09,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:09,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:20:09,538 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:20:09,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 19:20:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:09,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:20:09,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:20:09,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:20:09,694 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 19:20:09,730 INFO L387 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 28 treesize of output 16 [2022-03-15 19:20:09,783 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:20:09,784 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 43 [2022-03-15 19:20:09,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:20:09,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:20:13,427 WARN L838 $PredicateComparison]: unable to prove that (or (<= 2147483647 c_~max~0) (forall ((v_ArrVal_552 Int) (thread1Thread1of1ForFork0_~i~0 Int) (v_ArrVal_550 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_550) c_~A~0.base))) (let ((.cse0 (select (store .cse1 c_~A~0.offset v_ArrVal_552) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (<= .cse0 (+ c_~max~0 1)) (< v_ArrVal_552 .cse0) (not (<= v_ArrVal_552 (+ (select .cse1 c_~A~0.offset) 1)))))))) is different from false [2022-03-15 19:20:13,447 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 106 [2022-03-15 19:20:13,454 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:20:13,454 INFO L387 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 90 treesize of output 88 [2022-03-15 19:20:13,461 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:20:13,461 INFO L387 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 131 treesize of output 119 [2022-03-15 19:20:13,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:20:13,526 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506972118] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:20:13,526 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:20:13,526 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 26 [2022-03-15 19:20:13,526 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2094911577] [2022-03-15 19:20:13,526 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:20:13,530 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:20:13,549 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 161 transitions. [2022-03-15 19:20:13,549 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:14,389 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:20:14,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:20:14,389 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:14,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:20:14,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=576, Unknown=7, NotChecked=50, Total=756 [2022-03-15 19:20:14,390 INFO L87 Difference]: Start difference. First operand 1520 states and 5856 transitions. Second operand has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:14,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:20:14,772 INFO L93 Difference]: Finished difference Result 3552 states and 13471 transitions. [2022-03-15 19:20:14,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 19:20:14,773 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:20:14,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:20:14,779 INFO L225 Difference]: With dead ends: 3552 [2022-03-15 19:20:14,779 INFO L226 Difference]: Without dead ends: 1342 [2022-03-15 19:20:14,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 89 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=321, Invalid=1158, Unknown=7, NotChecked=74, Total=1560 [2022-03-15 19:20:14,780 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 199 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:20:14,780 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 16 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:20:14,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2022-03-15 19:20:14,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1009. [2022-03-15 19:20:14,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1008 states have (on average 3.822420634920635) internal successors, (3853), 1008 states have internal predecessors, (3853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:14,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 3853 transitions. [2022-03-15 19:20:14,800 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 3853 transitions. Word has length 31 [2022-03-15 19:20:14,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:20:14,801 INFO L470 AbstractCegarLoop]: Abstraction has 1009 states and 3853 transitions. [2022-03-15 19:20:14,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:14,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 3853 transitions. [2022-03-15 19:20:14,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:20:14,803 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:14,803 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:20:14,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 19:20:15,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:15,020 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:20:15,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:15,020 INFO L85 PathProgramCache]: Analyzing trace with hash -552154915, now seen corresponding path program 8 times [2022-03-15 19:20:15,021 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:15,021 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285767756] [2022-03-15 19:20:15,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:15,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:15,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:20:15,091 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:15,091 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285767756] [2022-03-15 19:20:15,091 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285767756] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:20:15,091 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:20:15,092 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 19:20:15,092 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1260704258] [2022-03-15 19:20:15,092 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:20:15,095 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:20:15,110 INFO L252 McrAutomatonBuilder]: Finished intersection with 72 states and 121 transitions. [2022-03-15 19:20:15,110 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:15,592 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:20:15,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:20:15,592 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:15,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:20:15,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:20:15,592 INFO L87 Difference]: Start difference. First operand 1009 states and 3853 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:15,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:20:15,665 INFO L93 Difference]: Finished difference Result 1116 states and 4196 transitions. [2022-03-15 19:20:15,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:20:15,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:20:15,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:20:15,668 INFO L225 Difference]: With dead ends: 1116 [2022-03-15 19:20:15,668 INFO L226 Difference]: Without dead ends: 941 [2022-03-15 19:20:15,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:20:15,669 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 10 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:20:15,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 5 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:20:15,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2022-03-15 19:20:15,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 921. [2022-03-15 19:20:15,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 3.751086956521739) internal successors, (3451), 920 states have internal predecessors, (3451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:15,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 3451 transitions. [2022-03-15 19:20:15,684 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 3451 transitions. Word has length 31 [2022-03-15 19:20:15,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:20:15,684 INFO L470 AbstractCegarLoop]: Abstraction has 921 states and 3451 transitions. [2022-03-15 19:20:15,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:15,684 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 3451 transitions. [2022-03-15 19:20:15,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:20:15,686 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:15,686 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:20:15,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-15 19:20:15,687 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:20:15,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:15,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1892261787, now seen corresponding path program 9 times [2022-03-15 19:20:15,687 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:15,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707790537] [2022-03-15 19:20:15,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:15,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:15,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:20:15,780 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:15,780 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707790537] [2022-03-15 19:20:15,780 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707790537] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:20:15,780 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242191995] [2022-03-15 19:20:15,780 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:20:15,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:15,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:20:15,784 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:20:15,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 19:20:16,069 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:20:16,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:20:16,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 19:20:16,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:20:16,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:20:16,142 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 19:20:16,213 INFO L387 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 28 treesize of output 16 [2022-03-15 19:20:16,269 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-03-15 19:20:16,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:20:16,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:20:16,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:20:16,580 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242191995] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:20:16,580 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:20:16,581 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 8] total 27 [2022-03-15 19:20:16,581 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1454638909] [2022-03-15 19:20:16,581 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:20:16,584 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:20:16,605 INFO L252 McrAutomatonBuilder]: Finished intersection with 98 states and 191 transitions. [2022-03-15 19:20:16,606 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:17,598 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [41843#(or (<= 2147483647 ~max~0) (<= ~min~0 (+ ~max~0 1))), 41927#(<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~max~0)] [2022-03-15 19:20:17,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:20:17,598 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:17,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:20:17,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2022-03-15 19:20:17,599 INFO L87 Difference]: Start difference. First operand 921 states and 3451 transitions. Second operand has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:17,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:20:17,917 INFO L93 Difference]: Finished difference Result 1195 states and 4439 transitions. [2022-03-15 19:20:17,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 19:20:17,917 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:20:17,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:20:17,920 INFO L225 Difference]: With dead ends: 1195 [2022-03-15 19:20:17,920 INFO L226 Difference]: Without dead ends: 953 [2022-03-15 19:20:17,920 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 102 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=288, Invalid=1194, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:20:17,921 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 163 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:20:17,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 8 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:20:17,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2022-03-15 19:20:17,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 929. [2022-03-15 19:20:17,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 928 states have (on average 3.742456896551724) internal successors, (3473), 928 states have internal predecessors, (3473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:17,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 3473 transitions. [2022-03-15 19:20:17,937 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 3473 transitions. Word has length 31 [2022-03-15 19:20:17,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:20:17,937 INFO L470 AbstractCegarLoop]: Abstraction has 929 states and 3473 transitions. [2022-03-15 19:20:17,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:17,937 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 3473 transitions. [2022-03-15 19:20:17,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:20:17,939 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:17,939 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:20:17,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 19:20:18,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:18,156 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 19:20:18,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:18,157 INFO L85 PathProgramCache]: Analyzing trace with hash 66426425, now seen corresponding path program 10 times [2022-03-15 19:20:18,158 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:18,158 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194546944] [2022-03-15 19:20:18,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:18,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:18,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:20:18,258 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:18,258 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194546944] [2022-03-15 19:20:18,259 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194546944] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:20:18,259 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104667765] [2022-03-15 19:20:18,259 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:20:18,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:18,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:20:18,276 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) [2022-03-15 19:20:18,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 19:20:18,401 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:20:18,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:20:18,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 38 conjunts are in the unsatisfiable core [2022-03-15 19:20:18,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:20:18,441 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 19:20:18,468 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:20:18,497 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:20:18,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:20:18,542 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 19:20:18,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:20:18,567 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-15 19:20:18,631 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-03-15 19:20:18,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:20:18,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:20:18,821 WARN L838 $PredicateComparison]: unable to prove that (or (<= 2147483647 c_~max~0) (forall ((v_ArrVal_721 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_721) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1)))) is different from false [2022-03-15 19:20:18,829 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_720) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_721) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1))) (<= 2147483647 c_~max~0)) is different from false [2022-03-15 19:20:18,834 WARN L838 $PredicateComparison]: unable to prove that (or (<= 2147483647 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_720) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_721) c_~A~0.base) c_~A~0.offset) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) 1)))) is different from false [2022-03-15 19:20:18,844 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_719))) (let ((.cse0 (select (select .cse1 c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_720) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_721) c_~A~0.base) c_~A~0.offset) (+ .cse0 1)))))) is different from false [2022-03-15 19:20:18,859 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_718) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_719))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_720) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_721) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ .cse1 1)) (<= 2147483647 .cse1))))) is different from false [2022-03-15 19:20:18,865 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:20:18,865 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 57 [2022-03-15 19:20:18,880 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152391 treesize of output 143167 [2022-03-15 19:20:24,728 WARN L228 SmtUtils]: Spent 5.85s on a formula simplification. DAG size of input: 1012 DAG size of output: 1012 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-03-15 19:20:24,749 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139839 treesize of output 135227 [2022-03-15 19:20:25,149 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135227 treesize of output 127027 [2022-03-15 19:20:25,545 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126934 treesize of output 118742 [2022-03-15 19:20:25,939 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118742 treesize of output 114646 Received shutdown request... [2022-03-15 19:33:57,199 WARN L244 SmtUtils]: Removed 1 from assertion stack [2022-03-15 19:33:57,201 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-03-15 19:33:57,214 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:33:57,214 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:33:57,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-15 19:33:57,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 19:33:57,428 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. [2022-03-15 19:33:57,429 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 5 remaining) [2022-03-15 19:33:57,430 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 5 remaining) [2022-03-15 19:33:57,430 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 5 remaining) [2022-03-15 19:33:57,430 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATION (0 of 5 remaining) [2022-03-15 19:33:57,432 INFO L732 BasicCegarLoop]: Path program histogram: [10, 1, 1, 1, 1] [2022-03-15 19:33:57,434 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 19:33:57,434 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 19:33:57,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 07:33:57 BasicIcfg [2022-03-15 19:33:57,438 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 19:33:57,439 INFO L158 Benchmark]: Toolchain (without parser) took 873122.66ms. Allocated memory was 182.5MB in the beginning and 1.1GB in the end (delta: 915.4MB). Free memory was 131.3MB in the beginning and 862.2MB in the end (delta: -730.9MB). Peak memory consumption was 675.3MB. Max. memory is 8.0GB. [2022-03-15 19:33:57,439 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 182.5MB. Free memory is still 147.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 19:33:57,439 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.31ms. Allocated memory is still 182.5MB. Free memory was 131.1MB in the beginning and 156.2MB in the end (delta: -25.1MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. [2022-03-15 19:33:57,439 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.70ms. Allocated memory is still 182.5MB. Free memory was 156.2MB in the beginning and 154.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:33:57,440 INFO L158 Benchmark]: Boogie Preprocessor took 22.19ms. Allocated memory is still 182.5MB. Free memory was 154.1MB in the beginning and 152.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 19:33:57,440 INFO L158 Benchmark]: RCFGBuilder took 523.34ms. Allocated memory is still 182.5MB. Free memory was 152.6MB in the beginning and 131.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-03-15 19:33:57,441 INFO L158 Benchmark]: TraceAbstraction took 872281.50ms. Allocated memory was 182.5MB in the beginning and 1.1GB in the end (delta: 915.4MB). Free memory was 131.1MB in the beginning and 862.2MB in the end (delta: -731.1MB). Peak memory consumption was 675.0MB. Max. memory is 8.0GB. [2022-03-15 19:33:57,443 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.09ms. Allocated memory is still 182.5MB. Free memory is still 147.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 265.31ms. Allocated memory is still 182.5MB. Free memory was 131.1MB in the beginning and 156.2MB in the end (delta: -25.1MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.70ms. Allocated memory is still 182.5MB. Free memory was 156.2MB in the beginning and 154.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.19ms. Allocated memory is still 182.5MB. Free memory was 154.1MB in the beginning and 152.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 523.34ms. Allocated memory is still 182.5MB. Free memory was 152.6MB in the beginning and 131.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 872281.50ms. Allocated memory was 182.5MB in the beginning and 1.1GB in the end (delta: 915.4MB). Free memory was 131.1MB in the beginning and 862.2MB in the end (delta: -731.1MB). Peak memory consumption was 675.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 173 PlacesBefore, 45 PlacesAfterwards, 172 TransitionsBefore, 36 TransitionsAfterwards, 2280 CoEnabledTransitionPairs, 7 FixpointIterations, 88 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 14 TrivialYvCompositions, 6 ConcurrentYvCompositions, 8 ChoiceCompositions, 152 TotalNumberOfCompositions, 3643 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2637, positive: 2531, positive conditional: 0, positive unconditional: 2531, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1245, positive: 1209, positive conditional: 0, positive unconditional: 1209, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2637, positive: 1322, positive conditional: 0, positive unconditional: 1322, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 1245, unknown conditional: 0, unknown unconditional: 1245] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 97, Positive conditional cache size: 0, Positive unconditional cache size: 97, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 120]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 111]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 113]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 200 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 872.1s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1488 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1488 mSDsluCounter, 175 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 707 IncrementalHoareTripleChecker+Unchecked, 1683 mSDsCounter, 289 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3741 IncrementalHoareTripleChecker+Invalid, 4737 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 289 mSolverCounterUnsat, 42 mSDtfsCounter, 3741 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1455 GetRequests, 1084 SyntacticMatches, 67 SemanticMatches, 304 ConstructedPredicates, 13 IntricatePredicates, 2 DeprecatedPredicates, 4245 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1520occurred in iteration=10, InterpolantAutomatonStates: 135, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 3999 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 21.6s InterpolantComputationTime, 610 NumberOfCodeBlocks, 610 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 800 ConstructedInterpolants, 52 QuantifiedInterpolants, 9162 SizeOfPredicates, 113 NumberOfNonLiveVariables, 2030 ConjunctsInSsa, 224 ConjunctsInUnsatCore, 27 InterpolantComputations, 9 PerfectInterpolantSequences, 66/98 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown