/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-bad-buffer-mult-alt2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 19:04:35,420 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 19:04:35,422 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 19:04:35,472 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 19:04:35,473 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 19:04:35,474 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 19:04:35,475 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 19:04:35,476 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 19:04:35,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 19:04:35,480 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 19:04:35,481 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 19:04:35,482 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 19:04:35,482 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 19:04:35,483 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 19:04:35,484 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 19:04:35,485 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 19:04:35,485 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 19:04:35,486 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 19:04:35,488 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 19:04:35,489 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 19:04:35,490 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 19:04:35,496 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 19:04:35,499 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 19:04:35,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 19:04:35,507 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 19:04:35,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 19:04:35,507 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 19:04:35,508 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 19:04:35,508 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 19:04:35,509 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 19:04:35,509 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 19:04:35,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 19:04:35,511 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 19:04:35,511 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 19:04:35,512 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 19:04:35,512 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 19:04:35,513 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 19:04:35,513 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 19:04:35,513 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 19:04:35,514 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 19:04:35,514 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 19:04:35,521 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:04:35,548 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 19:04:35,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 19:04:35,549 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 19:04:35,549 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 19:04:35,549 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 19:04:35,549 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 19:04:35,550 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 19:04:35,550 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 19:04:35,550 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 19:04:35,550 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 19:04:35,550 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 19:04:35,550 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 19:04:35,550 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 19:04:35,550 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 19:04:35,551 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 19:04:35,551 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 19:04:35,551 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 19:04:35,554 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 19:04:35,554 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 19:04:35,554 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 19:04:35,554 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 19:04:35,554 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 19:04:35,554 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 19:04:35,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:04:35,555 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 19:04:35,555 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 19:04:35,555 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 19:04:35,555 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 19:04:35,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 19:04:35,556 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 19:04:35,556 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 19:04:35,556 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 19:04:35,556 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:04:35,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 19:04:35,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 19:04:35,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 19:04:35,782 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 19:04:35,783 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 19:04:35,784 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2022-03-15 19:04:35,838 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccd9ec86d/ce71449e88024bff9351ea2e25244fb7/FLAG70fa9f812 [2022-03-15 19:04:36,185 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 19:04:36,185 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2022-03-15 19:04:36,191 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccd9ec86d/ce71449e88024bff9351ea2e25244fb7/FLAG70fa9f812 [2022-03-15 19:04:36,202 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccd9ec86d/ce71449e88024bff9351ea2e25244fb7 [2022-03-15 19:04:36,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 19:04:36,205 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 19:04:36,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 19:04:36,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 19:04:36,211 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 19:04:36,212 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:04:36" (1/1) ... [2022-03-15 19:04:36,213 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c5a2cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:04:36, skipping insertion in model container [2022-03-15 19:04:36,213 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:04:36" (1/1) ... [2022-03-15 19:04:36,218 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 19:04:36,248 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 19:04:36,434 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-bad-buffer-mult-alt2.wvr.c[4174,4187] [2022-03-15 19:04:36,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:04:36,461 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 19:04:36,492 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-bad-buffer-mult-alt2.wvr.c[4174,4187] [2022-03-15 19:04:36,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:04:36,507 INFO L208 MainTranslator]: Completed translation [2022-03-15 19:04:36,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:04:36 WrapperNode [2022-03-15 19:04:36,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 19:04:36,509 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 19:04:36,509 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 19:04:36,509 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 19:04:36,515 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:04:36" (1/1) ... [2022-03-15 19:04:36,535 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:04:36" (1/1) ... [2022-03-15 19:04:36,564 INFO L137 Inliner]: procedures = 26, calls = 75, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 315 [2022-03-15 19:04:36,565 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 19:04:36,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 19:04:36,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 19:04:36,565 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 19:04:36,572 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:04:36" (1/1) ... [2022-03-15 19:04:36,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:04:36" (1/1) ... [2022-03-15 19:04:36,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:04:36" (1/1) ... [2022-03-15 19:04:36,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:04:36" (1/1) ... [2022-03-15 19:04:36,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:04:36" (1/1) ... [2022-03-15 19:04:36,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:04:36" (1/1) ... [2022-03-15 19:04:36,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:04:36" (1/1) ... [2022-03-15 19:04:36,620 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 19:04:36,621 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 19:04:36,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 19:04:36,621 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 19:04:36,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:04:36" (1/1) ... [2022-03-15 19:04:36,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:04:36,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:04:36,657 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:04:36,659 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:04:36,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 19:04:36,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 19:04:36,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 19:04:36,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 19:04:36,687 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 19:04:36,687 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 19:04:36,687 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 19:04:36,687 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 19:04:36,687 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 19:04:36,687 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 19:04:36,687 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-03-15 19:04:36,688 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-03-15 19:04:36,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 19:04:36,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 19:04:36,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 19:04:36,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 19:04:36,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 19:04:36,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 19:04:36,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 19:04:36,690 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:04:36,773 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 19:04:36,774 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 19:04:37,266 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 19:04:37,397 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 19:04:37,398 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-03-15 19:04:37,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:04:37 BoogieIcfgContainer [2022-03-15 19:04:37,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 19:04:37,403 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 19:04:37,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 19:04:37,406 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 19:04:37,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 07:04:36" (1/3) ... [2022-03-15 19:04:37,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@265ae0de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:04:37, skipping insertion in model container [2022-03-15 19:04:37,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:04:36" (2/3) ... [2022-03-15 19:04:37,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@265ae0de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:04:37, skipping insertion in model container [2022-03-15 19:04:37,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:04:37" (3/3) ... [2022-03-15 19:04:37,409 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt2.wvr.c [2022-03-15 19:04:37,413 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 19:04:37,413 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 19:04:37,414 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 19:04:37,414 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 19:04:37,483 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,483 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,484 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,484 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,484 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,485 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,486 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,486 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,486 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,486 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,486 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,486 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,487 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,487 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,487 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,487 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,487 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,488 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,489 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,489 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,489 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,489 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,489 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,489 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,490 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,490 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,491 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,493 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,493 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,494 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,494 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,494 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,495 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,495 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,495 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,495 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,495 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,496 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,496 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,496 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,496 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,496 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,496 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,497 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,497 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,497 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,497 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,497 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,497 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,498 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,500 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,500 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,500 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,500 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,501 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,501 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,501 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,502 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,502 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,502 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,502 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,502 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,502 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,502 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,502 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,503 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,503 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,503 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,503 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,503 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,503 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,503 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,506 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,506 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,506 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,506 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,506 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,506 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,506 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,507 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,507 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,507 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,508 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,508 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,509 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,509 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,511 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,517 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,517 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,517 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,518 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,518 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,518 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,519 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,519 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,519 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,519 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,519 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,519 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,519 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,519 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,519 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,519 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,520 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,521 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,521 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,521 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,521 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,521 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,521 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,521 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,521 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,521 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,522 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,522 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,522 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,527 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,527 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,527 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~short6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,527 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,528 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,528 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,528 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,528 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,528 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,529 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,529 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,529 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,529 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,529 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,529 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,529 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,530 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,530 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,530 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,530 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,530 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,531 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,531 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,531 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~short2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,531 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,532 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,532 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,532 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,532 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,532 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,532 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,533 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,533 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,533 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,533 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,534 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,534 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,534 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,534 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,534 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,535 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,535 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,535 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,535 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork3_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:04:37,543 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-03-15 19:04:37,577 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 19:04:37,581 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:04:37,582 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-03-15 19:04:37,594 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 19:04:37,601 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 239 places, 245 transitions, 522 flow [2022-03-15 19:04:37,603 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 239 places, 245 transitions, 522 flow [2022-03-15 19:04:37,605 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 239 places, 245 transitions, 522 flow [2022-03-15 19:04:37,674 INFO L129 PetriNetUnfolder]: 19/241 cut-off events. [2022-03-15 19:04:37,674 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-03-15 19:04:37,679 INFO L84 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 241 events. 19/241 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 115 event pairs, 0 based on Foata normal form. 0/221 useless extension candidates. Maximal degree in co-relation 202. Up to 2 conditions per place. [2022-03-15 19:04:37,682 INFO L116 LiptonReduction]: Number of co-enabled transitions 1824 [2022-03-15 19:04:46,268 INFO L131 LiptonReduction]: Checked pairs total: 3213 [2022-03-15 19:04:46,269 INFO L133 LiptonReduction]: Total number of compositions: 240 [2022-03-15 19:04:46,275 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 40 transitions, 112 flow [2022-03-15 19:04:46,367 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 526 states, 525 states have (on average 4.102857142857143) internal successors, (2154), 525 states have internal predecessors, (2154), 0 states have call successors, (0), 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:04:46,370 INFO L276 IsEmpty]: Start isEmpty. Operand has 526 states, 525 states have (on average 4.102857142857143) internal successors, (2154), 525 states have internal predecessors, (2154), 0 states have call successors, (0), 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:04:46,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:04:46,394 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:04:46,394 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:04:46,395 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:04:46,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:04:46,399 INFO L85 PathProgramCache]: Analyzing trace with hash 338732934, now seen corresponding path program 1 times [2022-03-15 19:04:46,414 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:04:46,414 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215282692] [2022-03-15 19:04:46,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:04:46,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:04:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:04:46,873 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:04:46,873 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:04:46,874 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215282692] [2022-03-15 19:04:46,874 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215282692] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:04:46,875 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:04:46,875 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 19:04:46,876 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2110091137] [2022-03-15 19:04:46,876 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:04:46,884 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:04:47,050 INFO L252 McrAutomatonBuilder]: Finished intersection with 324 states and 947 transitions. [2022-03-15 19:04:47,050 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:04:49,672 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1299#(not (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)), 1300#(< ~i~0 ~N~0)] [2022-03-15 19:04:49,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 19:04:49,674 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:04:49,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 19:04:49,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-03-15 19:04:49,708 INFO L87 Difference]: Start difference. First operand has 526 states, 525 states have (on average 4.102857142857143) internal successors, (2154), 525 states have internal predecessors, (2154), 0 states have call successors, (0), 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 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 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:04:49,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:04:49,864 INFO L93 Difference]: Finished difference Result 654 states and 2704 transitions. [2022-03-15 19:04:49,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:04:49,866 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 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 27 [2022-03-15 19:04:49,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:04:49,881 INFO L225 Difference]: With dead ends: 654 [2022-03-15 19:04:49,881 INFO L226 Difference]: Without dead ends: 654 [2022-03-15 19:04:49,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-03-15 19:04:49,885 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 47 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:04:49,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 18 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:04:49,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2022-03-15 19:04:49,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 654. [2022-03-15 19:04:49,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 653 states have (on average 4.1408882082695255) internal successors, (2704), 653 states have internal predecessors, (2704), 0 states have call successors, (0), 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:04:49,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 2704 transitions. [2022-03-15 19:04:49,954 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 2704 transitions. Word has length 27 [2022-03-15 19:04:49,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:04:49,954 INFO L470 AbstractCegarLoop]: Abstraction has 654 states and 2704 transitions. [2022-03-15 19:04:49,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 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:04:49,955 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 2704 transitions. [2022-03-15 19:04:49,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:04:49,958 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:04:49,958 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:04:49,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 19:04:49,958 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:04:49,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:04:49,959 INFO L85 PathProgramCache]: Analyzing trace with hash 14212964, now seen corresponding path program 1 times [2022-03-15 19:04:49,960 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:04:49,960 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007690957] [2022-03-15 19:04:49,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:04:49,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:04:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:04:50,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:50,029 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:04:50,029 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007690957] [2022-03-15 19:04:50,030 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007690957] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:04:50,030 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:04:50,030 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:04:50,030 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1252603054] [2022-03-15 19:04:50,030 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:04:50,039 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:04:50,168 INFO L252 McrAutomatonBuilder]: Finished intersection with 246 states and 680 transitions. [2022-03-15 19:04:50,168 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:04:51,635 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:04:51,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:04:51,637 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:04:51,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:04:51,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:04:51,637 INFO L87 Difference]: Start difference. First operand 654 states and 2704 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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:04:51,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:04:51,724 INFO L93 Difference]: Finished difference Result 853 states and 3387 transitions. [2022-03-15 19:04:51,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:04:51,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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:04:51,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:04:51,729 INFO L225 Difference]: With dead ends: 853 [2022-03-15 19:04:51,729 INFO L226 Difference]: Without dead ends: 655 [2022-03-15 19:04:51,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:04:51,731 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 17 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:04:51,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 18 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:04:51,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2022-03-15 19:04:51,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2022-03-15 19:04:51,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 654 states have (on average 4.136085626911315) internal successors, (2705), 654 states have internal predecessors, (2705), 0 states have call successors, (0), 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:04:51,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 2705 transitions. [2022-03-15 19:04:51,755 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 2705 transitions. Word has length 28 [2022-03-15 19:04:51,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:04:51,756 INFO L470 AbstractCegarLoop]: Abstraction has 655 states and 2705 transitions. [2022-03-15 19:04:51,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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:04:51,756 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 2705 transitions. [2022-03-15 19:04:51,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:04:51,758 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:04:51,759 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:04:51,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 19:04:51,759 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:04:51,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:04:51,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1220554346, now seen corresponding path program 1 times [2022-03-15 19:04:51,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:04:51,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123548892] [2022-03-15 19:04:51,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:04:51,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:04:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:04:51,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:04:51,939 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:04:51,939 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123548892] [2022-03-15 19:04:51,939 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123548892] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:04:51,939 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330670014] [2022-03-15 19:04:51,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:04:51,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:04:51,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:04:51,941 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:04:51,974 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:04:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:04:52,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 19:04:52,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:04:52,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:04:52,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:04:52,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:04:52,438 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330670014] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:04:52,439 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:04:52,439 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 13 [2022-03-15 19:04:52,439 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [501722666] [2022-03-15 19:04:52,439 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:04:52,447 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:04:52,524 INFO L252 McrAutomatonBuilder]: Finished intersection with 247 states and 681 transitions. [2022-03-15 19:04:52,524 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:04:56,161 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [5613#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 5611#(not (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)), 5615#(or (<= (+ ~q1_front~0 1) ~q1_back~0) (not (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0))), 5612#(or (not (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (not (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0))), 5614#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0) (not (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)))] [2022-03-15 19:04:56,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:04:56,162 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:04:56,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:04:56,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-03-15 19:04:56,164 INFO L87 Difference]: Start difference. First operand 655 states and 2705 transitions. Second operand has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 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:04:56,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:04:56,517 INFO L93 Difference]: Finished difference Result 1093 states and 4523 transitions. [2022-03-15 19:04:56,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 19:04:56,517 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 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:04:56,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:04:56,525 INFO L225 Difference]: With dead ends: 1093 [2022-03-15 19:04:56,525 INFO L226 Difference]: Without dead ends: 1093 [2022-03-15 19:04:56,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 219 SyntacticMatches, 43 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2022-03-15 19:04:56,528 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 134 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:04:56,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 78 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:04:56,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2022-03-15 19:04:56,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 839. [2022-03-15 19:04:56,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 838 states have (on average 4.144391408114559) internal successors, (3473), 838 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:04:56,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 3473 transitions. [2022-03-15 19:04:56,559 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 3473 transitions. Word has length 29 [2022-03-15 19:04:56,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:04:56,559 INFO L470 AbstractCegarLoop]: Abstraction has 839 states and 3473 transitions. [2022-03-15 19:04:56,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 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:04:56,560 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 3473 transitions. [2022-03-15 19:04:56,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:04:56,563 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:04:56,563 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:04:56,590 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:04:56,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:04:56,786 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:04:56,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:04:56,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1515237034, now seen corresponding path program 2 times [2022-03-15 19:04:56,788 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:04:56,788 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842555498] [2022-03-15 19:04:56,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:04:56,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:04:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:04:56,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:04:56,933 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:04:56,934 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842555498] [2022-03-15 19:04:56,934 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842555498] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:04:56,934 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520264083] [2022-03-15 19:04:56,934 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:04:56,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:04:56,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:04:56,935 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:04:56,937 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:04:57,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 19:04:57,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:04:57,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 19:04:57,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:04:57,184 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:04:57,184 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 19:04:57,185 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520264083] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:04:57,185 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 19:04:57,185 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-03-15 19:04:57,185 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1547868409] [2022-03-15 19:04:57,185 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:04:57,191 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:04:57,283 INFO L252 McrAutomatonBuilder]: Finished intersection with 305 states and 881 transitions. [2022-03-15 19:04:57,284 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:05:00,793 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [8486#(not (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 8485#(< ~q1_back~0 0), 8487#(or (not (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (< ~q1_back~0 0)), 8488#(or (= |thread3Thread1of1ForFork1_~cond~2#1| 1) (< ~q1_back~0 0)), 8489#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0) (< ~q1_back~0 0))] [2022-03-15 19:05:00,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:05:00,794 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:05:00,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:05:00,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-03-15 19:05:00,795 INFO L87 Difference]: Start difference. First operand 839 states and 3473 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 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:05:01,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:05:01,048 INFO L93 Difference]: Finished difference Result 1379 states and 5617 transitions. [2022-03-15 19:05:01,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:05:01,049 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 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:05:01,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:05:01,058 INFO L225 Difference]: With dead ends: 1379 [2022-03-15 19:05:01,058 INFO L226 Difference]: Without dead ends: 1379 [2022-03-15 19:05:01,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 295 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-03-15 19:05:01,062 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 136 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:05:01,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 40 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:05:01,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2022-03-15 19:05:01,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 719. [2022-03-15 19:05:01,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 718 states have (on average 4.018105849582173) internal successors, (2885), 718 states have internal predecessors, (2885), 0 states have call successors, (0), 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:05:01,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 2885 transitions. [2022-03-15 19:05:01,093 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 2885 transitions. Word has length 29 [2022-03-15 19:05:01,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:05:01,093 INFO L470 AbstractCegarLoop]: Abstraction has 719 states and 2885 transitions. [2022-03-15 19:05:01,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 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:05:01,093 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 2885 transitions. [2022-03-15 19:05:01,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:05:01,096 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:05:01,097 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:05:01,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-15 19:05:01,311 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,SelfDestructingSolverStorable3 [2022-03-15 19:05:01,312 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:05:01,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:05:01,312 INFO L85 PathProgramCache]: Analyzing trace with hash 228670296, now seen corresponding path program 1 times [2022-03-15 19:05:01,313 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:05:01,313 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258614507] [2022-03-15 19:05:01,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:05:01,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:05:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:05:01,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:01,775 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:05:01,776 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258614507] [2022-03-15 19:05:01,776 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258614507] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:05:01,776 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523586493] [2022-03-15 19:05:01,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:05:01,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:01,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:05:01,777 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:05:01,807 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:05:01,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:05:01,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 19:05:01,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:05:01,983 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:05:02,090 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:05:02,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:05:02,260 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 18 treesize of output 20 [2022-03-15 19:05:02,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:05:02,327 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 18 treesize of output 20 [2022-03-15 19:05:02,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:05:02,376 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 18 treesize of output 20 [2022-03-15 19:05:02,430 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-15 19:05:02,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:02,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:05:02,954 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:05:02,954 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 64 treesize of output 52 [2022-03-15 19:05:02,959 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 695 treesize of output 671 [2022-03-15 19:05:02,971 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 650 treesize of output 554 [2022-03-15 19:05:02,983 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 296 treesize of output 278 [2022-03-15 19:05:02,990 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 542 treesize of output 518 [2022-03-15 19:05:02,998 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 518 treesize of output 470 [2022-03-15 19:05:04,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:04,145 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523586493] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:05:04,145 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:05:04,145 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 23 [2022-03-15 19:05:04,145 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1969731459] [2022-03-15 19:05:04,146 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:05:04,153 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:05:04,258 INFO L252 McrAutomatonBuilder]: Finished intersection with 373 states and 1092 transitions. [2022-03-15 19:05:04,258 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:05:11,903 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [11518#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0))] [2022-03-15 19:05:11,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:05:11,904 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:05:11,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:05:11,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=542, Unknown=13, NotChecked=0, Total=650 [2022-03-15 19:05:11,905 INFO L87 Difference]: Start difference. First operand 719 states and 2885 transitions. Second operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 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:05:12,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:05:12,291 INFO L93 Difference]: Finished difference Result 1361 states and 5463 transitions. [2022-03-15 19:05:12,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 19:05:12,291 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 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:05:12,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:05:12,300 INFO L225 Difference]: With dead ends: 1361 [2022-03-15 19:05:12,300 INFO L226 Difference]: Without dead ends: 1338 [2022-03-15 19:05:12,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 371 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=635, Unknown=13, NotChecked=0, Total=756 [2022-03-15 19:05:12,301 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 56 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:05:12,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 49 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:05:12,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2022-03-15 19:05:12,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1154. [2022-03-15 19:05:12,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1153 states have (on average 4.029488291413704) internal successors, (4646), 1153 states have internal predecessors, (4646), 0 states have call successors, (0), 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:05:12,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 4646 transitions. [2022-03-15 19:05:12,341 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 4646 transitions. Word has length 31 [2022-03-15 19:05:12,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:05:12,341 INFO L470 AbstractCegarLoop]: Abstraction has 1154 states and 4646 transitions. [2022-03-15 19:05:12,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 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:05:12,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 4646 transitions. [2022-03-15 19:05:12,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:05:12,345 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:05:12,346 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:05:12,366 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:05:12,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:12,556 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:05:12,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:05:12,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1941551470, now seen corresponding path program 2 times [2022-03-15 19:05:12,557 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:05:12,557 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810117773] [2022-03-15 19:05:12,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:05:12,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:05:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:05:13,235 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:13,236 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:05:13,236 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810117773] [2022-03-15 19:05:13,236 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810117773] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:05:13,236 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504721070] [2022-03-15 19:05:13,236 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:05:13,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:13,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:05:13,237 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:05:13,238 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:05:13,372 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:05:13,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:05:13,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 19:05:13,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:05:13,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:05:13,596 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 18 treesize of output 20 [2022-03-15 19:05:13,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:05:13,634 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 18 treesize of output 20 [2022-03-15 19:05:13,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:05:13,682 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 18 treesize of output 20 [2022-03-15 19:05:13,716 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:05:13,751 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:05:13,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:05:13,829 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_329 (Array Int Int))) (<= 1 (+ c_~total~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_329) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset))))) is different from false [2022-03-15 19:05:13,839 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_328 (Array Int Int)) (v_ArrVal_329 (Array Int Int))) (<= 1 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_328) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_329) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) c_~total~0))) is different from false [2022-03-15 19:05:13,848 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_328 (Array Int Int)) (v_ArrVal_327 (Array Int Int)) (v_ArrVal_329 (Array Int Int))) (<= 1 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_327) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_328) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_329) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) c_~total~0))) is different from false [2022-03-15 19:05:13,864 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:05:13,865 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 342 treesize of output 334 [2022-03-15 19:05:13,869 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 157 treesize of output 145 [2022-03-15 19:05:13,873 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 302 treesize of output 278 [2022-03-15 19:05:13,880 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 278 treesize of output 230 [2022-03-15 19:05:14,209 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-03-15 19:05:14,209 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504721070] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:05:14,209 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:05:14,209 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 23 [2022-03-15 19:05:14,209 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1483992060] [2022-03-15 19:05:14,210 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:05:14,215 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:05:14,334 INFO L252 McrAutomatonBuilder]: Finished intersection with 374 states and 1093 transitions. [2022-03-15 19:05:14,334 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:05:21,635 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [15403#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0))] [2022-03-15 19:05:21,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:05:21,636 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:05:21,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:05:21,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=434, Unknown=3, NotChecked=132, Total=650 [2022-03-15 19:05:21,636 INFO L87 Difference]: Start difference. First operand 1154 states and 4646 transitions. Second operand has 11 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 0 states have call successors, (0), 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:05:22,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:05:22,013 INFO L93 Difference]: Finished difference Result 2116 states and 8564 transitions. [2022-03-15 19:05:22,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:05:22,014 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 0 states have call successors, (0), 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 32 [2022-03-15 19:05:22,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:05:22,030 INFO L225 Difference]: With dead ends: 2116 [2022-03-15 19:05:22,030 INFO L226 Difference]: Without dead ends: 2093 [2022-03-15 19:05:22,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 374 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=473, Unknown=3, NotChecked=138, Total=702 [2022-03-15 19:05:22,031 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 61 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:05:22,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 48 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:05:22,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2022-03-15 19:05:22,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1325. [2022-03-15 19:05:22,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1324 states have (on average 4.044561933534744) internal successors, (5355), 1324 states have internal predecessors, (5355), 0 states have call successors, (0), 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:05:22,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 5355 transitions. [2022-03-15 19:05:22,084 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 5355 transitions. Word has length 32 [2022-03-15 19:05:22,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:05:22,084 INFO L470 AbstractCegarLoop]: Abstraction has 1325 states and 5355 transitions. [2022-03-15 19:05:22,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 0 states have call successors, (0), 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:05:22,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 5355 transitions. [2022-03-15 19:05:22,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:05:22,088 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:05:22,089 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:05:22,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-15 19:05:22,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:22,303 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:05:22,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:05:22,304 INFO L85 PathProgramCache]: Analyzing trace with hash 409340669, now seen corresponding path program 1 times [2022-03-15 19:05:22,305 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:05:22,305 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999576343] [2022-03-15 19:05:22,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:05:22,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:05:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:05:22,677 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:05:22,677 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:05:22,677 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999576343] [2022-03-15 19:05:22,677 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999576343] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:05:22,677 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295462703] [2022-03-15 19:05:22,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:05:22,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:22,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:05:22,678 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:05:22,679 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:05:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:05:22,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 19:05:22,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:05:22,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:05:22,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:05:22,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:05:22,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:05:22,852 INFO L353 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-03-15 19:05:22,853 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 47 [2022-03-15 19:05:22,902 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:05:22,946 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 19:05:22,946 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 11 treesize of output 11 [2022-03-15 19:05:22,995 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:05:23,049 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:05:23,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:05:23,179 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:05:23,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:05:23,226 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 18 treesize of output 20 [2022-03-15 19:05:23,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:05:23,276 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 18 treesize of output 20 [2022-03-15 19:05:23,317 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-15 19:05:23,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:23,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:05:23,397 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_409 (Array Int Int))) (<= 1 (+ c_~total~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_409) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset))))) is different from false [2022-03-15 19:05:23,403 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_409 (Array Int Int)) (v_ArrVal_408 (Array Int Int))) (<= 1 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_408) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_409) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) c_~total~0))) is different from false [2022-03-15 19:05:23,410 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_409 (Array Int Int)) (v_ArrVal_408 (Array Int Int))) (<= 1 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_407) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_408) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_409) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) c_~total~0))) is different from false [2022-03-15 19:05:23,718 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:05:23,719 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 70 treesize of output 58 [2022-03-15 19:05:23,723 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 1405 treesize of output 1381 [2022-03-15 19:05:23,735 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 1322 treesize of output 1274 [2022-03-15 19:05:23,747 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 1274 treesize of output 1082 [2022-03-15 19:05:23,759 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 1082 treesize of output 986 [2022-03-15 19:05:23,769 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 1045 treesize of output 1009 [2022-03-15 19:05:23,782 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 513 treesize of output 495 [2022-03-15 19:05:23,795 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-03-15 19:05:24,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-15 19:05:24,707 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295462703] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:05:24,708 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:05:24,708 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 25 [2022-03-15 19:05:24,708 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [866037385] [2022-03-15 19:05:24,708 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:05:24,712 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:05:24,859 INFO L252 McrAutomatonBuilder]: Finished intersection with 374 states and 1093 transitions. [2022-03-15 19:05:24,860 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:05:32,116 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [20385#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0))] [2022-03-15 19:05:32,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:05:32,116 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:05:32,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:05:32,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=490, Unknown=19, NotChecked=144, Total=756 [2022-03-15 19:05:32,117 INFO L87 Difference]: Start difference. First operand 1325 states and 5355 transitions. Second operand has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 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:05:32,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:05:32,433 INFO L93 Difference]: Finished difference Result 2230 states and 8983 transitions. [2022-03-15 19:05:32,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:05:32,433 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 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 32 [2022-03-15 19:05:32,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:05:32,446 INFO L225 Difference]: With dead ends: 2230 [2022-03-15 19:05:32,447 INFO L226 Difference]: Without dead ends: 2207 [2022-03-15 19:05:32,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 369 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=579, Unknown=20, NotChecked=156, Total=870 [2022-03-15 19:05:32,448 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 62 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:05:32,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 53 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:05:32,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2207 states. [2022-03-15 19:05:32,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2207 to 1325. [2022-03-15 19:05:32,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1324 states have (on average 4.044561933534744) internal successors, (5355), 1324 states have internal predecessors, (5355), 0 states have call successors, (0), 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:05:32,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 5355 transitions. [2022-03-15 19:05:32,495 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 5355 transitions. Word has length 32 [2022-03-15 19:05:32,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:05:32,495 INFO L470 AbstractCegarLoop]: Abstraction has 1325 states and 5355 transitions. [2022-03-15 19:05:32,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 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:05:32,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 5355 transitions. [2022-03-15 19:05:32,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:05:32,501 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:05:32,501 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 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:05:32,525 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:05:32,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:32,715 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:05:32,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:05:32,716 INFO L85 PathProgramCache]: Analyzing trace with hash -498949480, now seen corresponding path program 3 times [2022-03-15 19:05:32,716 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:05:32,717 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844282347] [2022-03-15 19:05:32,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:05:32,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:05:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:05:33,256 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:33,256 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:05:33,256 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844282347] [2022-03-15 19:05:33,256 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844282347] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:05:33,256 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880168757] [2022-03-15 19:05:33,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:05:33,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:33,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:05:33,264 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:05:33,274 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:05:33,420 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:05:33,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:05:33,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 19:05:33,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:05:33,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:05:33,620 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 18 treesize of output 20 [2022-03-15 19:05:33,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:05:33,653 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 18 treesize of output 20 [2022-03-15 19:05:33,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:05:33,683 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 18 treesize of output 20 [2022-03-15 19:05:33,707 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 7 [2022-03-15 19:05:33,742 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:05:33,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:05:33,795 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_484 (Array Int Int))) (<= 1 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_484) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) c_~total~0))) is different from false [2022-03-15 19:05:33,806 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_483 (Array Int Int)) (v_ArrVal_484 (Array Int Int))) (<= 1 (+ c_~total~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_483) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_484) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset))))) is different from false [2022-03-15 19:05:33,814 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_483 (Array Int Int)) (v_ArrVal_482 (Array Int Int)) (v_ArrVal_484 (Array Int Int))) (<= 1 (+ c_~total~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_482) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_483) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_484) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset))))) is different from false [2022-03-15 19:05:33,830 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:05:33,831 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 341 treesize of output 333 [2022-03-15 19:05:33,835 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 314 treesize of output 266 [2022-03-15 19:05:33,842 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 266 treesize of output 242 [2022-03-15 19:05:33,848 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 126 treesize of output 114 [2022-03-15 19:05:34,139 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2022-03-15 19:05:34,139 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880168757] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:05:34,139 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:05:34,139 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-03-15 19:05:34,139 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [179725716] [2022-03-15 19:05:34,139 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:05:34,145 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:05:34,297 INFO L252 McrAutomatonBuilder]: Finished intersection with 375 states and 1094 transitions. [2022-03-15 19:05:34,298 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:05:41,660 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [25487#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0))] [2022-03-15 19:05:41,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:05:41,661 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:05:41,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:05:41,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=428, Unknown=3, NotChecked=132, Total=650 [2022-03-15 19:05:41,661 INFO L87 Difference]: Start difference. First operand 1325 states and 5355 transitions. Second operand has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 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:05:42,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:05:42,087 INFO L93 Difference]: Finished difference Result 2447 states and 9917 transitions. [2022-03-15 19:05:42,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:05:42,087 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 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 33 [2022-03-15 19:05:42,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:05:42,102 INFO L225 Difference]: With dead ends: 2447 [2022-03-15 19:05:42,102 INFO L226 Difference]: Without dead ends: 2424 [2022-03-15 19:05:42,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 374 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=735, Unknown=3, NotChecked=174, Total=1056 [2022-03-15 19:05:42,103 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 103 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:05:42,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 52 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:05:42,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2022-03-15 19:05:42,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 1326. [2022-03-15 19:05:42,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1326 states, 1325 states have (on average 4.043018867924529) internal successors, (5357), 1325 states have internal predecessors, (5357), 0 states have call successors, (0), 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:05:42,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 5357 transitions. [2022-03-15 19:05:42,151 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 5357 transitions. Word has length 33 [2022-03-15 19:05:42,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:05:42,151 INFO L470 AbstractCegarLoop]: Abstraction has 1326 states and 5357 transitions. [2022-03-15 19:05:42,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 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:05:42,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 5357 transitions. [2022-03-15 19:05:42,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:05:42,156 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:05:42,156 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:05:42,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-03-15 19:05:42,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:42,380 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:05:42,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:05:42,381 INFO L85 PathProgramCache]: Analyzing trace with hash 45109364, now seen corresponding path program 4 times [2022-03-15 19:05:42,382 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:05:42,382 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198229929] [2022-03-15 19:05:42,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:05:42,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:05:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:05:42,493 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:05:42,493 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:05:42,493 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198229929] [2022-03-15 19:05:42,493 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198229929] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:05:42,493 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731085332] [2022-03-15 19:05:42,493 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:05:42,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:42,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:05:42,495 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:05:42,519 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:05:42,647 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:05:42,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:05:42,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 19:05:42,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:05:42,784 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:05:42,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:05:42,947 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:05:42,948 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731085332] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:05:42,948 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:05:42,948 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2022-03-15 19:05:42,948 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1116668581] [2022-03-15 19:05:42,948 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:05:42,954 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:05:43,068 INFO L252 McrAutomatonBuilder]: Finished intersection with 375 states and 1094 transitions. [2022-03-15 19:05:43,068 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:05:50,350 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [30811#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= (+ ~q1_front~0 2) ~q1_back~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 30766#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< (+ ~q1_front~0 1) ~q1_back~0)), 30739#(not (<= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0))] [2022-03-15 19:05:50,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:05:50,350 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:05:50,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:05:50,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-03-15 19:05:50,351 INFO L87 Difference]: Start difference. First operand 1326 states and 5357 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 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:05:50,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:05:50,728 INFO L93 Difference]: Finished difference Result 3748 states and 15180 transitions. [2022-03-15 19:05:50,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:05:50,728 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 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 33 [2022-03-15 19:05:50,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:05:50,748 INFO L225 Difference]: With dead ends: 3748 [2022-03-15 19:05:50,748 INFO L226 Difference]: Without dead ends: 3748 [2022-03-15 19:05:50,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 268 SyntacticMatches, 127 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1846 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2022-03-15 19:05:50,749 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 95 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:05:50,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 50 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:05:50,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3748 states. [2022-03-15 19:05:50,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3748 to 1862. [2022-03-15 19:05:50,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1862 states, 1861 states have (on average 4.102632993014509) internal successors, (7635), 1861 states have internal predecessors, (7635), 0 states have call successors, (0), 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:05:50,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 7635 transitions. [2022-03-15 19:05:50,822 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 7635 transitions. Word has length 33 [2022-03-15 19:05:50,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:05:50,822 INFO L470 AbstractCegarLoop]: Abstraction has 1862 states and 7635 transitions. [2022-03-15 19:05:50,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 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:05:50,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 7635 transitions. [2022-03-15 19:05:50,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:05:50,828 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:05:50,828 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:05:50,854 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:05:51,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:51,048 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:05:51,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:05:51,048 INFO L85 PathProgramCache]: Analyzing trace with hash 430096586, now seen corresponding path program 5 times [2022-03-15 19:05:51,049 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:05:51,049 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156126476] [2022-03-15 19:05:51,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:05:51,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:05:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:05:51,113 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:51,114 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:05:51,114 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156126476] [2022-03-15 19:05:51,114 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156126476] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:05:51,114 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125719309] [2022-03-15 19:05:51,114 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:05:51,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:51,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:05:51,115 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:05:51,117 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:05:51,240 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:05:51,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:05:51,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:05:51,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:05:51,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:51,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:05:51,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:51,455 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125719309] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:05:51,455 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:05:51,455 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-03-15 19:05:51,456 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1782296621] [2022-03-15 19:05:51,456 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:05:51,460 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:05:51,654 INFO L252 McrAutomatonBuilder]: Finished intersection with 505 states and 1522 transitions. [2022-03-15 19:05:51,655 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:00,858 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [38447#(or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0))), 38499#(or (< ~q1_front~0 0) (<= ~n1~0 (+ ~q1_front~0 1)) (<= ~q1_back~0 (+ ~q1_front~0 1))), 38500#(or (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~q1_back~0 (+ ~q1_front~0 1)))] [2022-03-15 19:06:00,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:06:00,859 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:00,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:06:00,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-03-15 19:06:00,859 INFO L87 Difference]: Start difference. First operand 1862 states and 7635 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 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:06:01,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:01,109 INFO L93 Difference]: Finished difference Result 4638 states and 18694 transitions. [2022-03-15 19:06:01,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:06:01,110 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 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 33 [2022-03-15 19:06:01,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:01,128 INFO L225 Difference]: With dead ends: 4638 [2022-03-15 19:06:01,128 INFO L226 Difference]: Without dead ends: 4106 [2022-03-15 19:06:01,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 400 SyntacticMatches, 126 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1379 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2022-03-15 19:06:01,129 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 201 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:01,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 45 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:06:01,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2022-03-15 19:06:01,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 2936. [2022-03-15 19:06:01,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2936 states, 2935 states have (on average 4.253833049403748) internal successors, (12485), 2935 states have internal predecessors, (12485), 0 states have call successors, (0), 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:06:01,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2936 states to 2936 states and 12485 transitions. [2022-03-15 19:06:01,243 INFO L78 Accepts]: Start accepts. Automaton has 2936 states and 12485 transitions. Word has length 33 [2022-03-15 19:06:01,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:01,244 INFO L470 AbstractCegarLoop]: Abstraction has 2936 states and 12485 transitions. [2022-03-15 19:06:01,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 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:06:01,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2936 states and 12485 transitions. [2022-03-15 19:06:01,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:06:01,254 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:01,254 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:01,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 19:06:01,478 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,SelfDestructingSolverStorable9 [2022-03-15 19:06:01,478 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:06:01,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:01,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1057365303, now seen corresponding path program 1 times [2022-03-15 19:06:01,479 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:01,479 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312012737] [2022-03-15 19:06:01,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:01,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:01,538 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:06:01,538 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:01,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312012737] [2022-03-15 19:06:01,538 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312012737] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:06:01,538 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:06:01,538 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 19:06:01,539 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [145411354] [2022-03-15 19:06:01,539 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:01,545 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:01,704 INFO L252 McrAutomatonBuilder]: Finished intersection with 457 states and 1348 transitions. [2022-03-15 19:06:01,704 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:05,470 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:06:05,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:06:05,471 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:05,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:06:05,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:06:05,471 INFO L87 Difference]: Start difference. First operand 2936 states and 12485 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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:06:05,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:05,556 INFO L93 Difference]: Finished difference Result 5048 states and 20284 transitions. [2022-03-15 19:06:05,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:06:05,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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 33 [2022-03-15 19:06:05,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:05,576 INFO L225 Difference]: With dead ends: 5048 [2022-03-15 19:06:05,576 INFO L226 Difference]: Without dead ends: 4848 [2022-03-15 19:06:05,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 425 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:06:05,577 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:05,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 18 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:06:05,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4848 states. [2022-03-15 19:06:05,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4848 to 4554. [2022-03-15 19:06:05,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4554 states, 4553 states have (on average 4.072918954535471) internal successors, (18544), 4553 states have internal predecessors, (18544), 0 states have call successors, (0), 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:06:05,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4554 states to 4554 states and 18544 transitions. [2022-03-15 19:06:05,704 INFO L78 Accepts]: Start accepts. Automaton has 4554 states and 18544 transitions. Word has length 33 [2022-03-15 19:06:05,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:05,705 INFO L470 AbstractCegarLoop]: Abstraction has 4554 states and 18544 transitions. [2022-03-15 19:06:05,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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:06:05,705 INFO L276 IsEmpty]: Start isEmpty. Operand 4554 states and 18544 transitions. [2022-03-15 19:06:05,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:06:05,719 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:05,719 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 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:06:05,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-15 19:06:05,720 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:06:05,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:05,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1272039250, now seen corresponding path program 6 times [2022-03-15 19:06:05,721 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:05,721 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421085382] [2022-03-15 19:06:05,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:05,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:06,497 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:06,497 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:06,497 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421085382] [2022-03-15 19:06:06,497 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421085382] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:06,497 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815832153] [2022-03-15 19:06:06,497 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:06:06,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:06,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:06,499 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:06,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 19:06:06,757 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:06:06,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:06,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 19:06:06,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:07,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:06:07,039 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 18 treesize of output 20 [2022-03-15 19:06:07,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:06:07,091 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 18 treesize of output 20 [2022-03-15 19:06:07,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:06:07,131 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 18 treesize of output 20 [2022-03-15 19:06:07,167 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:06:07,203 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:06:07,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:07,414 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:06:07,414 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 172 treesize of output 172 [2022-03-15 19:06:07,431 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 152 treesize of output 128 [2022-03-15 19:06:07,470 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 66 treesize of output 60 [2022-03-15 19:06:07,474 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 122 treesize of output 110 [2022-03-15 19:06:07,756 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:06:07,757 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815832153] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:07,757 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:07,757 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 8] total 27 [2022-03-15 19:06:07,757 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2103611628] [2022-03-15 19:06:07,757 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:07,762 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:07,877 INFO L252 McrAutomatonBuilder]: Finished intersection with 376 states and 1095 transitions. [2022-03-15 19:06:07,877 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:15,278 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [63406#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0))] [2022-03-15 19:06:15,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:06:15,278 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:15,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:06:15,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=749, Unknown=5, NotChecked=0, Total=870 [2022-03-15 19:06:15,279 INFO L87 Difference]: Start difference. First operand 4554 states and 18544 transitions. Second operand has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 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:06:16,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:16,195 INFO L93 Difference]: Finished difference Result 6834 states and 27525 transitions. [2022-03-15 19:06:16,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 19:06:16,195 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 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 34 [2022-03-15 19:06:16,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:16,224 INFO L225 Difference]: With dead ends: 6834 [2022-03-15 19:06:16,224 INFO L226 Difference]: Without dead ends: 6511 [2022-03-15 19:06:16,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 373 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=170, Invalid=1231, Unknown=5, NotChecked=0, Total=1406 [2022-03-15 19:06:16,226 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 89 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:16,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 100 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:06:16,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6511 states. [2022-03-15 19:06:16,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6511 to 4555. [2022-03-15 19:06:16,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4555 states, 4554 states have (on average 4.072463768115942) internal successors, (18546), 4554 states have internal predecessors, (18546), 0 states have call successors, (0), 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:06:16,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4555 states to 4555 states and 18546 transitions. [2022-03-15 19:06:16,369 INFO L78 Accepts]: Start accepts. Automaton has 4555 states and 18546 transitions. Word has length 34 [2022-03-15 19:06:16,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:16,370 INFO L470 AbstractCegarLoop]: Abstraction has 4555 states and 18546 transitions. [2022-03-15 19:06:16,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 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:06:16,370 INFO L276 IsEmpty]: Start isEmpty. Operand 4555 states and 18546 transitions. [2022-03-15 19:06:16,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:06:16,384 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:16,384 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:16,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 19:06:16,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:16,603 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:06:16,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:16,604 INFO L85 PathProgramCache]: Analyzing trace with hash 416890232, now seen corresponding path program 7 times [2022-03-15 19:06:16,604 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:16,605 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488823524] [2022-03-15 19:06:16,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:16,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:16,668 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:06:16,669 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:16,669 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488823524] [2022-03-15 19:06:16,669 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488823524] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:16,669 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143579900] [2022-03-15 19:06:16,669 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:06:16,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:16,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:16,670 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:16,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 19:06:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:16,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:06:16,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:16,950 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:06:16,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:17,034 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:06:17,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143579900] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:17,035 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:17,035 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-15 19:06:17,035 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [351080438] [2022-03-15 19:06:17,035 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:17,042 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:17,222 INFO L252 McrAutomatonBuilder]: Finished intersection with 422 states and 1230 transitions. [2022-03-15 19:06:17,222 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:22,384 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [79578#(or (<= ~n1~0 ~q1_back~0) (<= ~q1_back~0 0)), 79577#(or (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)), 79576#(or (<= ~n1~0 0) (<= ~q1_back~0 0))] [2022-03-15 19:06:22,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:06:22,385 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:22,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:06:22,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-03-15 19:06:22,385 INFO L87 Difference]: Start difference. First operand 4555 states and 18546 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:22,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:22,519 INFO L93 Difference]: Finished difference Result 4765 states and 18558 transitions. [2022-03-15 19:06:22,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:06:22,519 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-03-15 19:06:22,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:22,534 INFO L225 Difference]: With dead ends: 4765 [2022-03-15 19:06:22,534 INFO L226 Difference]: Without dead ends: 4492 [2022-03-15 19:06:22,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 445 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-03-15 19:06:22,535 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 95 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:22,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 35 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:06:22,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4492 states. [2022-03-15 19:06:22,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4492 to 4040. [2022-03-15 19:06:22,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4040 states, 4039 states have (on average 3.9997524139638525) internal successors, (16155), 4039 states have internal predecessors, (16155), 0 states have call successors, (0), 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:06:22,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4040 states to 4040 states and 16155 transitions. [2022-03-15 19:06:22,639 INFO L78 Accepts]: Start accepts. Automaton has 4040 states and 16155 transitions. Word has length 34 [2022-03-15 19:06:22,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:22,639 INFO L470 AbstractCegarLoop]: Abstraction has 4040 states and 16155 transitions. [2022-03-15 19:06:22,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:22,640 INFO L276 IsEmpty]: Start isEmpty. Operand 4040 states and 16155 transitions. [2022-03-15 19:06:22,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:06:22,652 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:22,652 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:22,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 19:06:22,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 19:06:22,867 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:06:22,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:22,868 INFO L85 PathProgramCache]: Analyzing trace with hash 768171310, now seen corresponding path program 1 times [2022-03-15 19:06:22,869 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:22,869 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419758912] [2022-03-15 19:06:22,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:22,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:22,958 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:06:22,958 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:22,959 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419758912] [2022-03-15 19:06:22,959 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419758912] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:22,959 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098353866] [2022-03-15 19:06:22,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:22,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:22,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:22,964 INFO L229 MonitoredProcess]: Starting monitored process 12 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:06:22,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 19:06:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:23,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 19:06:23,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:23,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:06:23,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 19:06:23,169 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098353866] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:06:23,169 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 19:06:23,169 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-03-15 19:06:23,169 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [604408887] [2022-03-15 19:06:23,169 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:23,190 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:23,390 INFO L252 McrAutomatonBuilder]: Finished intersection with 458 states and 1349 transitions. [2022-03-15 19:06:23,390 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:28,901 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [92530#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))] [2022-03-15 19:06:28,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:06:28,902 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:28,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:06:28,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:06:28,902 INFO L87 Difference]: Start difference. First operand 4040 states and 16155 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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:06:28,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:28,984 INFO L93 Difference]: Finished difference Result 5036 states and 19865 transitions. [2022-03-15 19:06:28,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:06:28,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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 34 [2022-03-15 19:06:28,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:28,999 INFO L225 Difference]: With dead ends: 5036 [2022-03-15 19:06:28,999 INFO L226 Difference]: Without dead ends: 4894 [2022-03-15 19:06:28,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 455 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:06:29,000 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 19 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:29,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 11 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:06:29,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4894 states. [2022-03-15 19:06:29,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4894 to 4234. [2022-03-15 19:06:29,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4234 states, 4233 states have (on average 4.070635483108906) internal successors, (17231), 4233 states have internal predecessors, (17231), 0 states have call successors, (0), 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:06:29,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4234 states to 4234 states and 17231 transitions. [2022-03-15 19:06:29,112 INFO L78 Accepts]: Start accepts. Automaton has 4234 states and 17231 transitions. Word has length 34 [2022-03-15 19:06:29,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:29,112 INFO L470 AbstractCegarLoop]: Abstraction has 4234 states and 17231 transitions. [2022-03-15 19:06:29,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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:06:29,113 INFO L276 IsEmpty]: Start isEmpty. Operand 4234 states and 17231 transitions. [2022-03-15 19:06:29,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:06:29,125 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:29,125 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 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:06:29,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 19:06:29,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 19:06:29,350 INFO L402 AbstractCegarLoop]: === Iteration 15 === 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:06:29,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:29,350 INFO L85 PathProgramCache]: Analyzing trace with hash 338115032, now seen corresponding path program 8 times [2022-03-15 19:06:29,351 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:29,351 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779423775] [2022-03-15 19:06:29,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:29,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:30,042 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:30,043 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:30,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779423775] [2022-03-15 19:06:30,043 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779423775] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:30,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624717005] [2022-03-15 19:06:30,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:06:30,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:30,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:30,044 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:30,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 19:06:30,186 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:06:30,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:30,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 19:06:30,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:30,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:06:30,482 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 18 treesize of output 20 [2022-03-15 19:06:30,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:06:30,537 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 18 treesize of output 20 [2022-03-15 19:06:30,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:06:30,574 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 18 treesize of output 20 [2022-03-15 19:06:30,614 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:06:30,645 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:06:30,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:30,841 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:06:30,842 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 342 treesize of output 334 [2022-03-15 19:06:30,845 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 314 treesize of output 266 [2022-03-15 19:06:30,851 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 138 treesize of output 126 [2022-03-15 19:06:30,858 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 254 treesize of output 230 [2022-03-15 19:06:31,150 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:06:31,150 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624717005] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:31,150 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:31,151 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 8] total 28 [2022-03-15 19:06:31,151 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1044853891] [2022-03-15 19:06:31,151 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:31,156 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:31,315 INFO L252 McrAutomatonBuilder]: Finished intersection with 377 states and 1096 transitions. [2022-03-15 19:06:31,315 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:38,829 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [106269#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0))] [2022-03-15 19:06:38,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:06:38,830 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:38,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:06:38,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=786, Unknown=5, NotChecked=0, Total=930 [2022-03-15 19:06:38,830 INFO L87 Difference]: Start difference. First operand 4234 states and 17231 transitions. Second operand has 14 states, 13 states have (on average 4.0) internal successors, (52), 13 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:06:39,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:39,529 INFO L93 Difference]: Finished difference Result 6067 states and 24795 transitions. [2022-03-15 19:06:39,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:06:39,530 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 13 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 35 [2022-03-15 19:06:39,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:39,544 INFO L225 Difference]: With dead ends: 6067 [2022-03-15 19:06:39,544 INFO L226 Difference]: Without dead ends: 5744 [2022-03-15 19:06:39,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 375 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=208, Invalid=1269, Unknown=5, NotChecked=0, Total=1482 [2022-03-15 19:06:39,547 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 81 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:39,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 56 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:06:39,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5744 states. [2022-03-15 19:06:39,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5744 to 3783. [2022-03-15 19:06:39,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3783 states, 3782 states have (on average 4.106292966684294) internal successors, (15530), 3782 states have internal predecessors, (15530), 0 states have call successors, (0), 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:06:39,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3783 states to 3783 states and 15530 transitions. [2022-03-15 19:06:39,656 INFO L78 Accepts]: Start accepts. Automaton has 3783 states and 15530 transitions. Word has length 35 [2022-03-15 19:06:39,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:39,657 INFO L470 AbstractCegarLoop]: Abstraction has 3783 states and 15530 transitions. [2022-03-15 19:06:39,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 13 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:06:39,657 INFO L276 IsEmpty]: Start isEmpty. Operand 3783 states and 15530 transitions. [2022-03-15 19:06:39,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:06:39,668 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:39,668 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:39,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 19:06:39,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 19:06:39,888 INFO L402 AbstractCegarLoop]: === Iteration 16 === 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:06:39,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:39,888 INFO L85 PathProgramCache]: Analyzing trace with hash 121700070, now seen corresponding path program 9 times [2022-03-15 19:06:39,889 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:39,889 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640433107] [2022-03-15 19:06:39,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:39,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:40,468 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:40,468 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:40,468 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640433107] [2022-03-15 19:06:40,468 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640433107] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:40,468 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358728047] [2022-03-15 19:06:40,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:06:40,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:40,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:40,470 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:40,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 19:06:40,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:06:40,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:40,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-15 19:06:40,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:40,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:06:40,966 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 30 treesize of output 30 [2022-03-15 19:06:41,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:06:41,034 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 30 treesize of output 30 [2022-03-15 19:06:41,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:06:41,096 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 30 treesize of output 30 [2022-03-15 19:06:41,227 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:06:41,228 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 46 treesize of output 12 [2022-03-15 19:06:41,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:41,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:41,637 INFO L353 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2022-03-15 19:06:41,637 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 486 treesize of output 473 [2022-03-15 19:06:41,644 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:06:41,644 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 428 treesize of output 324 [2022-03-15 19:06:41,650 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:06:41,650 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 136 [2022-03-15 19:06:41,664 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:06:41,664 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 298 treesize of output 246 [2022-03-15 19:06:42,256 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:42,256 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358728047] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:42,256 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:42,256 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 33 [2022-03-15 19:06:42,256 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [957419351] [2022-03-15 19:06:42,256 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:42,262 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:42,455 INFO L252 McrAutomatonBuilder]: Finished intersection with 507 states and 1524 transitions. [2022-03-15 19:06:42,455 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:59,169 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [120159#(or (< 2147483647 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q1_front~0 0) (<= 2 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 (+ ~q1_front~0 1)) (< (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0) (<= ~q1_back~0 (+ ~q1_front~0 1)) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0)), 120160#(and (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (<= (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 2147483647)) (not (< ~q1_front~0 ~n1~0)) (<= (* ~n1~0 4) (+ 7 ~q1~0.offset (* ~q1_front~0 4)))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0)) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= ~q1~0.offset 0) (not (<= 0 ~q1_front~0)) (not (<= (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 2147483647)) (not (< ~q1_front~0 ~n1~0)))), 120158#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= 2 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0))] [2022-03-15 19:06:59,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:06:59,169 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:59,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:06:59,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1223, Unknown=8, NotChecked=0, Total=1406 [2022-03-15 19:06:59,170 INFO L87 Difference]: Start difference. First operand 3783 states and 15530 transitions. Second operand has 15 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 0 states have call successors, (0), 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:07:01,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:07:01,902 INFO L93 Difference]: Finished difference Result 19556 states and 78002 transitions. [2022-03-15 19:07:01,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 19:07:01,902 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 0 states have call successors, (0), 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 35 [2022-03-15 19:07:01,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:07:01,946 INFO L225 Difference]: With dead ends: 19556 [2022-03-15 19:07:01,946 INFO L226 Difference]: Without dead ends: 15580 [2022-03-15 19:07:01,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 497 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=476, Invalid=2378, Unknown=8, NotChecked=0, Total=2862 [2022-03-15 19:07:01,947 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 299 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:07:01,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 171 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:07:01,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15580 states. [2022-03-15 19:07:02,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15580 to 8349. [2022-03-15 19:07:02,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8349 states, 8348 states have (on average 4.25443219932918) internal successors, (35516), 8348 states have internal predecessors, (35516), 0 states have call successors, (0), 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:07:02,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8349 states to 8349 states and 35516 transitions. [2022-03-15 19:07:02,248 INFO L78 Accepts]: Start accepts. Automaton has 8349 states and 35516 transitions. Word has length 35 [2022-03-15 19:07:02,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:07:02,249 INFO L470 AbstractCegarLoop]: Abstraction has 8349 states and 35516 transitions. [2022-03-15 19:07:02,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 0 states have call successors, (0), 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:07:02,249 INFO L276 IsEmpty]: Start isEmpty. Operand 8349 states and 35516 transitions. [2022-03-15 19:07:02,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:07:02,274 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:07:02,274 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:07:02,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 19:07:02,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 19:07:02,488 INFO L402 AbstractCegarLoop]: === Iteration 17 === 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:07:02,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:07:02,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1455086492, now seen corresponding path program 10 times [2022-03-15 19:07:02,489 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:07:02,489 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746529341] [2022-03-15 19:07:02,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:07:02,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:07:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:07:03,091 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:03,092 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:07:03,092 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746529341] [2022-03-15 19:07:03,092 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746529341] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:07:03,092 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228684457] [2022-03-15 19:07:03,092 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:07:03,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:03,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:07:03,093 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:07:03,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 19:07:03,238 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:07:03,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:07:03,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 57 conjunts are in the unsatisfiable core [2022-03-15 19:07:03,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:07:03,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:07:03,626 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 30 treesize of output 30 [2022-03-15 19:07:03,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:07:03,706 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 30 treesize of output 30 [2022-03-15 19:07:03,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:07:03,848 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 43 treesize of output 41 [2022-03-15 19:07:03,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:07:03,988 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:07:03,988 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 12 [2022-03-15 19:07:04,019 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:04,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:07:04,431 INFO L353 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2022-03-15 19:07:04,432 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7630 treesize of output 6851 [2022-03-15 19:07:04,461 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 6806 treesize of output 5910 [2022-03-15 19:07:04,494 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:07:04,495 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 5910 treesize of output 5302 [2022-03-15 19:07:04,529 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:07:04,530 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 5302 treesize of output 4086 [2022-03-15 19:11:59,225 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:11:59,226 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228684457] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:11:59,226 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:11:59,226 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2022-03-15 19:11:59,226 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1102079106] [2022-03-15 19:11:59,226 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:11:59,231 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:11:59,400 INFO L252 McrAutomatonBuilder]: Finished intersection with 387 states and 1120 transitions. [2022-03-15 19:11:59,400 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:12:07,975 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [156688#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= 2 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0))] [2022-03-15 19:12:07,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:12:07,975 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:12:07,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:12:07,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1221, Unknown=6, NotChecked=0, Total=1406 [2022-03-15 19:12:07,976 INFO L87 Difference]: Start difference. First operand 8349 states and 35516 transitions. Second operand has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 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:12:08,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:12:08,905 INFO L93 Difference]: Finished difference Result 13492 states and 56586 transitions. [2022-03-15 19:12:08,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:12:08,905 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 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 35 [2022-03-15 19:12:08,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:12:08,946 INFO L225 Difference]: With dead ends: 13492 [2022-03-15 19:12:08,946 INFO L226 Difference]: Without dead ends: 13170 [2022-03-15 19:12:08,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 378 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=211, Invalid=1423, Unknown=6, NotChecked=0, Total=1640 [2022-03-15 19:12:08,947 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 126 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:12:08,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 116 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:12:08,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13170 states. [2022-03-15 19:12:09,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13170 to 8998. [2022-03-15 19:12:09,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8998 states, 8997 states have (on average 4.292875402912082) internal successors, (38623), 8997 states have internal predecessors, (38623), 0 states have call successors, (0), 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:12:09,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8998 states to 8998 states and 38623 transitions. [2022-03-15 19:12:09,234 INFO L78 Accepts]: Start accepts. Automaton has 8998 states and 38623 transitions. Word has length 35 [2022-03-15 19:12:09,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:12:09,234 INFO L470 AbstractCegarLoop]: Abstraction has 8998 states and 38623 transitions. [2022-03-15 19:12:09,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 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:12:09,235 INFO L276 IsEmpty]: Start isEmpty. Operand 8998 states and 38623 transitions. [2022-03-15 19:12:09,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:12:09,262 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:12:09,262 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:12:09,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 19:12:09,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:09,476 INFO L402 AbstractCegarLoop]: === Iteration 18 === 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:12:09,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:12:09,476 INFO L85 PathProgramCache]: Analyzing trace with hash -517033986, now seen corresponding path program 11 times [2022-03-15 19:12:09,477 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:12:09,477 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019051273] [2022-03-15 19:12:09,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:12:09,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:12:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:12:10,045 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:12:10,045 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:12:10,045 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019051273] [2022-03-15 19:12:10,045 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019051273] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:12:10,045 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172343154] [2022-03-15 19:12:10,046 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:12:10,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:10,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:12:10,047 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:12:10,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 19:12:10,242 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:12:10,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:12:10,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-15 19:12:10,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:12:10,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:12:10,522 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 18 treesize of output 20 [2022-03-15 19:12:10,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:12:10,599 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 18 treesize of output 20 [2022-03-15 19:12:10,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:12:10,658 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 18 treesize of output 20 [2022-03-15 19:12:10,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:12:10,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:12:10,854 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:12:10,855 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:12:10,855 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 15 [2022-03-15 19:12:10,890 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:12:10,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:12:11,256 INFO L353 Elim1Store]: treesize reduction 59, result has 41.0 percent of original size [2022-03-15 19:12:11,256 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 388 [2022-03-15 19:12:11,277 INFO L353 Elim1Store]: treesize reduction 37, result has 27.5 percent of original size [2022-03-15 19:12:11,278 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 344 treesize of output 282 [2022-03-15 19:12:11,298 INFO L353 Elim1Store]: treesize reduction 37, result has 27.5 percent of original size [2022-03-15 19:12:11,298 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 268 treesize of output 244 [2022-03-15 19:12:11,323 INFO L353 Elim1Store]: treesize reduction 37, result has 27.5 percent of original size [2022-03-15 19:12:11,323 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 119 [2022-03-15 19:12:14,745 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:12:14,745 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172343154] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:12:14,745 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:12:14,745 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 33 [2022-03-15 19:12:14,745 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [9666459] [2022-03-15 19:12:14,745 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:12:14,750 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:12:14,934 INFO L252 McrAutomatonBuilder]: Finished intersection with 423 states and 1231 transitions. [2022-03-15 19:12:14,935 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:12:27,611 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [188426#(and (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_front~0)) (not (<= (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 2147483647)) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~n1~0 ~q1_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (<= 0 ~q1_front~0)) (not (<= (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 2147483647))) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_front~0)) (not (<= (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 2147483647))) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_front~0)) (not (<= (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 2147483647)))), 188422#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0)), 188425#(and (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (= ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= ~n1~0 ~q1_back~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< ~q1_back~0 0))), 188424#(or (< 2147483647 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0)), 188423#(or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0))] [2022-03-15 19:12:27,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:12:27,611 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:12:27,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:12:27,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1342, Unknown=9, NotChecked=0, Total=1560 [2022-03-15 19:12:27,612 INFO L87 Difference]: Start difference. First operand 8998 states and 38623 transitions. Second operand has 17 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 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:12:29,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:12:29,469 INFO L93 Difference]: Finished difference Result 23586 states and 98559 transitions. [2022-03-15 19:12:29,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 19:12:29,469 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 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 35 [2022-03-15 19:12:29,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:12:29,538 INFO L225 Difference]: With dead ends: 23586 [2022-03-15 19:12:29,538 INFO L226 Difference]: Without dead ends: 22532 [2022-03-15 19:12:29,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 422 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=343, Invalid=2300, Unknown=9, NotChecked=0, Total=2652 [2022-03-15 19:12:29,540 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 278 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:12:29,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 175 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:12:29,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22532 states. [2022-03-15 19:12:29,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22532 to 11165. [2022-03-15 19:12:29,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11165 states, 11164 states have (on average 4.452794697241132) internal successors, (49711), 11164 states have internal predecessors, (49711), 0 states have call successors, (0), 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:12:29,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11165 states to 11165 states and 49711 transitions. [2022-03-15 19:12:29,922 INFO L78 Accepts]: Start accepts. Automaton has 11165 states and 49711 transitions. Word has length 35 [2022-03-15 19:12:29,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:12:29,922 INFO L470 AbstractCegarLoop]: Abstraction has 11165 states and 49711 transitions. [2022-03-15 19:12:29,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 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:12:29,922 INFO L276 IsEmpty]: Start isEmpty. Operand 11165 states and 49711 transitions. [2022-03-15 19:12:29,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:12:29,952 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:12:29,952 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:12:29,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 19:12:30,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 19:12:30,153 INFO L402 AbstractCegarLoop]: === Iteration 19 === 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:12:30,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:12:30,153 INFO L85 PathProgramCache]: Analyzing trace with hash -643356288, now seen corresponding path program 12 times [2022-03-15 19:12:30,154 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:12:30,154 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114100628] [2022-03-15 19:12:30,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:12:30,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:12:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:12:30,788 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:12:30,788 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:12:30,788 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114100628] [2022-03-15 19:12:30,789 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114100628] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:12:30,789 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737454673] [2022-03-15 19:12:30,789 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:12:30,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:30,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:12:30,790 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:12:30,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 19:12:30,941 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 19:12:30,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:12:30,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-15 19:12:30,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:12:31,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:12:31,255 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 18 treesize of output 20 [2022-03-15 19:12:31,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:12:31,323 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 18 treesize of output 20 [2022-03-15 19:12:31,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:12:31,524 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 42 treesize of output 40 [2022-03-15 19:12:31,621 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:12:31,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:12:31,624 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:12:31,624 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 15 [2022-03-15 19:12:31,656 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:12:31,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:12:31,725 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1226 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1226) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) c_~total~0))) is different from false [2022-03-15 19:12:32,054 INFO L353 Elim1Store]: treesize reduction 59, result has 41.0 percent of original size [2022-03-15 19:12:32,055 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1021 treesize of output 945 [2022-03-15 19:12:32,080 INFO L353 Elim1Store]: treesize reduction 37, result has 27.5 percent of original size [2022-03-15 19:12:32,080 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 901 treesize of output 751 [2022-03-15 19:12:32,106 INFO L353 Elim1Store]: treesize reduction 37, result has 27.5 percent of original size [2022-03-15 19:12:32,106 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 716 treesize of output 648 [2022-03-15 19:12:32,118 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 614 treesize of output 502 [2022-03-15 19:12:37,202 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:12:37,203 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737454673] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:12:37,203 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:12:37,203 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 34 [2022-03-15 19:12:37,203 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2054102240] [2022-03-15 19:12:37,203 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:12:37,208 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:12:37,349 INFO L252 McrAutomatonBuilder]: Finished intersection with 375 states and 1088 transitions. [2022-03-15 19:12:37,349 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:12:44,856 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [234607#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= 2 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0))] [2022-03-15 19:12:44,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:12:44,857 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:12:44,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:12:44,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1101, Unknown=5, NotChecked=68, Total=1332 [2022-03-15 19:12:44,857 INFO L87 Difference]: Start difference. First operand 11165 states and 49711 transitions. Second operand has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 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:12:46,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:12:46,219 INFO L93 Difference]: Finished difference Result 9903 states and 39497 transitions. [2022-03-15 19:12:46,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 19:12:46,220 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 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 35 [2022-03-15 19:12:46,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:12:46,243 INFO L225 Difference]: With dead ends: 9903 [2022-03-15 19:12:46,244 INFO L226 Difference]: Without dead ends: 9024 [2022-03-15 19:12:46,244 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 371 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=284, Invalid=1695, Unknown=5, NotChecked=86, Total=2070 [2022-03-15 19:12:46,245 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 232 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:12:46,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 134 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:12:46,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9024 states. [2022-03-15 19:12:46,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9024 to 6431. [2022-03-15 19:12:46,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6431 states, 6430 states have (on average 4.21353032659409) internal successors, (27093), 6430 states have internal predecessors, (27093), 0 states have call successors, (0), 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:12:46,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6431 states to 6431 states and 27093 transitions. [2022-03-15 19:12:46,458 INFO L78 Accepts]: Start accepts. Automaton has 6431 states and 27093 transitions. Word has length 35 [2022-03-15 19:12:46,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:12:46,459 INFO L470 AbstractCegarLoop]: Abstraction has 6431 states and 27093 transitions. [2022-03-15 19:12:46,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 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:12:46,459 INFO L276 IsEmpty]: Start isEmpty. Operand 6431 states and 27093 transitions. [2022-03-15 19:12:46,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:12:46,472 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:12:46,472 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:12:46,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-03-15 19:12:46,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:46,673 INFO L402 AbstractCegarLoop]: === Iteration 20 === 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:12:46,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:12:46,674 INFO L85 PathProgramCache]: Analyzing trace with hash 589955151, now seen corresponding path program 1 times [2022-03-15 19:12:46,675 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:12:46,675 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160879042] [2022-03-15 19:12:46,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:12:46,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:12:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:12:46,767 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:12:46,767 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:12:46,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160879042] [2022-03-15 19:12:46,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160879042] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:12:46,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704080759] [2022-03-15 19:12:46,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:12:46,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:46,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:12:46,769 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:12:46,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 19:12:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:12:46,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 19:12:46,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:12:47,111 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 19:12:47,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:12:47,256 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 19:12:47,256 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704080759] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:12:47,256 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:12:47,256 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 17 [2022-03-15 19:12:47,256 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1233648511] [2022-03-15 19:12:47,256 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:12:47,261 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:12:47,331 INFO L252 McrAutomatonBuilder]: Finished intersection with 204 states and 502 transitions. [2022-03-15 19:12:47,331 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:12:50,214 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [257612#(not (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 257614#(or (not (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (< ~q2_front~0 ~q2_back~0)), 257613#(or (not (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256))), 257616#(or (<= (+ ~q1_front~0 1) ~q1_back~0) (< ~q2_front~0 ~q2_back~0)), 257617#(or (< ~q1_front~0 0) (< ~q2_front~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0)), 257395#(<= (+ ~q1_front~0 1) ~q1_back~0), 257615#(or (<= (+ ~q1_front~0 1) ~q1_back~0) (not (= (mod |thread4Thread1of1ForFork3_~cond~3#1| 256) 0)))] [2022-03-15 19:12:50,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:12:50,215 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:12:50,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:12:50,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2022-03-15 19:12:50,215 INFO L87 Difference]: Start difference. First operand 6431 states and 27093 transitions. Second operand has 14 states, 14 states have (on average 8.428571428571429) internal successors, (118), 14 states have internal predecessors, (118), 0 states have call successors, (0), 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:12:51,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:12:51,324 INFO L93 Difference]: Finished difference Result 13845 states and 59911 transitions. [2022-03-15 19:12:51,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 19:12:51,324 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.428571428571429) internal successors, (118), 14 states have internal predecessors, (118), 0 states have call successors, (0), 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 35 [2022-03-15 19:12:51,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:12:51,364 INFO L225 Difference]: With dead ends: 13845 [2022-03-15 19:12:51,364 INFO L226 Difference]: Without dead ends: 13845 [2022-03-15 19:12:51,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 191 SyntacticMatches, 32 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=442, Invalid=1538, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:12:51,365 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 168 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:12:51,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 45 Invalid, 1472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1410 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:12:51,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13845 states. [2022-03-15 19:12:51,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13845 to 7519. [2022-03-15 19:12:51,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7519 states, 7518 states have (on average 4.277600425645119) internal successors, (32159), 7518 states have internal predecessors, (32159), 0 states have call successors, (0), 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:12:51,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7519 states to 7519 states and 32159 transitions. [2022-03-15 19:12:51,571 INFO L78 Accepts]: Start accepts. Automaton has 7519 states and 32159 transitions. Word has length 35 [2022-03-15 19:12:51,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:12:51,571 INFO L470 AbstractCegarLoop]: Abstraction has 7519 states and 32159 transitions. [2022-03-15 19:12:51,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.428571428571429) internal successors, (118), 14 states have internal predecessors, (118), 0 states have call successors, (0), 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:12:51,571 INFO L276 IsEmpty]: Start isEmpty. Operand 7519 states and 32159 transitions. [2022-03-15 19:12:51,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:12:51,586 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:12:51,586 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:12:51,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-03-15 19:12:51,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:51,787 INFO L402 AbstractCegarLoop]: === Iteration 21 === 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:12:51,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:12:51,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1765842228, now seen corresponding path program 1 times [2022-03-15 19:12:51,788 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:12:51,788 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106771284] [2022-03-15 19:12:51,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:12:51,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:12:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:12:51,956 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:12:51,956 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:12:51,957 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106771284] [2022-03-15 19:12:51,957 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106771284] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:12:51,957 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781874548] [2022-03-15 19:12:51,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:12:51,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:12:51,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:12:51,958 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:12:51,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 19:12:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:12:52,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 19:12:52,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:12:52,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:12:52,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:12:52,929 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:12:52,929 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781874548] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:12:52,929 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:12:52,930 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 10] total 25 [2022-03-15 19:12:52,930 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [336097857] [2022-03-15 19:12:52,930 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:12:52,935 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:12:53,096 INFO L252 McrAutomatonBuilder]: Finished intersection with 406 states and 1132 transitions. [2022-03-15 19:12:53,096 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:12:56,368 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 14 treesize of output 6 [2022-03-15 19:12:56,444 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:12:56,597 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:12:56,698 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:12:57,039 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 14 treesize of output 6 [2022-03-15 19:12:57,339 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 14 treesize of output 6 [2022-03-15 19:12:57,444 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:13:02,783 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 29 new interpolants: [286785#(or (<= (+ ~q2_back~0 1) ~q2_front~0) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< (+ ~j~0 1) ~M~0) (< ~q2_front~0 0) (= (mod |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), 286796#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 0) (not (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0))) (or (<= ~M~0 ~j~0) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)))), 286801#(or (<= ~M~0 ~j~0) (<= (+ ~q2_back~0 1) ~q2_front~0) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< (+ ~j~0 1) ~M~0) (< ~q2_front~0 0) (not (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0))), 286797#(or (<= (+ ~q2_back~0 1) ~q2_front~0) (< (+ ~j~0 1) ~M~0) (not (< ~j~0 ~M~0)) (< ~q2_front~0 0)), 286789#(or (<= (+ ~q2_back~0 1) ~q2_front~0) (< (+ ~j~0 1) ~M~0) (< ~q2_front~0 0) (not (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (= (mod |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), 286803#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= ~j~0 0) (not (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (< ~j~0 ~M~0)) (not (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)))), 286793#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (not (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (not (= (mod |thread2Thread1of1ForFork0_~cond~1#1| 256) 0))), 286780#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 286798#(or (<= ~M~0 ~j~0) (<= (+ ~q2_back~0 1) ~q2_front~0) (< (+ ~j~0 1) ~M~0) (< ~q2_front~0 0) (not (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0))), 286788#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (not (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (not (= (mod |thread2Thread1of1ForFork0_~cond~1#1| 256) 0))), 286786#(and (or (<= ~M~0 ~j~0) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 0))), 286802#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= ~j~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (< ~j~0 ~M~0)))), 286775#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 286777#(not (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)), 286779#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (not (= (mod |thread2Thread1of1ForFork0_~cond~1#1| 256) 0))), 286781#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0)), 286776#(not (= (mod |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), 286790#(and (or (= (* (- 1) |thread2Thread1of1ForFork0_~cond~1#1|) 0) (not (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0))) (or (<= ~M~0 ~j~0) (not (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)))), 286783#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (mod |thread2Thread1of1ForFork0_~cond~1#1| 256) 0))), 286784#(or (<= (+ ~q2_back~0 1) ~q2_front~0) (< (+ ~j~0 1) ~M~0) (< ~q2_front~0 0) (= (mod |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), 286778#(or (not (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (not (= (mod |thread2Thread1of1ForFork0_~cond~1#1| 256) 0))), 286787#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (not (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0))), 286800#(or (<= (+ ~q2_back~0 1) ~q2_front~0) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< (+ ~j~0 1) ~M~0) (not (< ~j~0 ~M~0)) (< ~q2_front~0 0)), 286782#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (not (= (mod |thread2Thread1of1ForFork0_~cond~1#1| 256) 0))), 286792#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0))), 286799#(and (or (not (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (<= ~M~0 0)) (or (= ~j~0 0) (not (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)))), 286795#(or (<= (+ ~q2_back~0 1) ~q2_front~0) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< (+ ~j~0 1) ~M~0) (< ~q2_front~0 0) (not (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (= (mod |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), 286791#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (not (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0))), 286794#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (not (= (mod |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)))] [2022-03-15 19:13:02,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 19:13:02,784 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:13:02,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 19:13:02,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=2651, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 19:13:02,785 INFO L87 Difference]: Start difference. First operand 7519 states and 32159 transitions. Second operand has 36 states, 36 states have (on average 7.25) internal successors, (261), 35 states have internal predecessors, (261), 0 states have call successors, (0), 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:13:05,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:13:05,075 INFO L93 Difference]: Finished difference Result 9939 states and 41079 transitions. [2022-03-15 19:13:05,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 19:13:05,075 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 7.25) internal successors, (261), 35 states have internal predecessors, (261), 0 states have call successors, (0), 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 35 [2022-03-15 19:13:05,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:13:05,101 INFO L225 Difference]: With dead ends: 9939 [2022-03-15 19:13:05,102 INFO L226 Difference]: Without dead ends: 9479 [2022-03-15 19:13:05,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 377 SyntacticMatches, 15 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2142 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1112, Invalid=5530, Unknown=0, NotChecked=0, Total=6642 [2022-03-15 19:13:05,104 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 1157 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 1567 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 1733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:13:05,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1157 Valid, 4 Invalid, 1733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1567 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 19:13:05,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9479 states. [2022-03-15 19:13:05,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9479 to 8099. [2022-03-15 19:13:05,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8099 states, 8098 states have (on average 4.266485551988145) internal successors, (34550), 8098 states have internal predecessors, (34550), 0 states have call successors, (0), 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:13:05,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8099 states to 8099 states and 34550 transitions. [2022-03-15 19:13:05,281 INFO L78 Accepts]: Start accepts. Automaton has 8099 states and 34550 transitions. Word has length 35 [2022-03-15 19:13:05,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:13:05,281 INFO L470 AbstractCegarLoop]: Abstraction has 8099 states and 34550 transitions. [2022-03-15 19:13:05,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.25) internal successors, (261), 35 states have internal predecessors, (261), 0 states have call successors, (0), 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:13:05,282 INFO L276 IsEmpty]: Start isEmpty. Operand 8099 states and 34550 transitions. [2022-03-15 19:13:05,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:13:05,298 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:13:05,298 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:13:05,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-03-15 19:13:05,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:05,499 INFO L402 AbstractCegarLoop]: === Iteration 22 === 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:13:05,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:13:05,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1868528468, now seen corresponding path program 2 times [2022-03-15 19:13:05,500 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:13:05,500 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531014546] [2022-03-15 19:13:05,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:13:05,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:13:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:13:05,633 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:13:05,634 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:13:05,634 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531014546] [2022-03-15 19:13:05,634 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531014546] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:13:05,634 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393331435] [2022-03-15 19:13:05,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:13:05,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:05,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:13:05,635 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:13:05,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 19:13:05,855 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:13:05,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:13:05,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 19:13:05,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:13:06,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:13:06,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:13:06,390 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:13:06,391 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393331435] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:13:06,391 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:13:06,391 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 20 [2022-03-15 19:13:06,391 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2140239465] [2022-03-15 19:13:06,391 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:13:06,398 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:13:06,698 INFO L252 McrAutomatonBuilder]: Finished intersection with 420 states and 1166 transitions. [2022-03-15 19:13:06,698 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:13:14,323 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [313227#(or (< (+ ~i~0 1) ~N~0) (not (< ~i~0 ~N~0))), 313170#(or (not (<= (mod |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)) (< (+ ~i~0 1) ~N~0) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)), 313234#(and (or (< (+ ~j~0 1) ~M~0) (not (< ~j~0 ~M~0)) (not (<= ~N~0 ~i~0))) (or (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (< (+ ~j~0 1) ~M~0) (not (< ~j~0 ~M~0)))), 313232#(or (<= ~M~0 ~j~0) (< (+ ~j~0 1) ~M~0) (< (+ ~i~0 1) ~N~0) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)), 313166#(or (< (+ ~i~0 1) ~N~0) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)), 313228#(or (< (+ ~i~0 1) ~N~0) (<= ~N~0 ~i~0) (not (= (mod |thread2Thread1of1ForFork0_~cond~1#1| 256) 0))), 313229#(or (< (+ ~j~0 1) ~M~0) (< (+ ~i~0 1) ~N~0) (not (< ~i~0 ~N~0)) (= (mod |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), 313231#(or (<= ~M~0 ~j~0) (< (+ ~j~0 1) ~M~0) (not (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0))), 313230#(or (< (+ ~j~0 1) ~M~0) (not (< ~j~0 ~M~0))), 313162#(not (<= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)), 313223#(or (< (+ ~j~0 1) ~M~0) (not (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (= (mod |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), 313221#(or (not (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (not (= (mod |thread2Thread1of1ForFork0_~cond~1#1| 256) 0))), 313226#(or (< (+ ~j~0 1) ~M~0) (< (+ ~i~0 1) ~N~0) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (= (mod |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), 313220#(not (= (mod |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), 313225#(and (or (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (< (+ ~j~0 1) ~M~0) (= (mod |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)) (or (< (+ ~j~0 1) ~M~0) (not (<= ~N~0 ~i~0)) (= (mod |thread2Thread1of1ForFork0_~cond~1#1| 256) 0))), 313222#(or (< (+ ~j~0 1) ~M~0) (= (mod |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)), 313224#(and (or (not (<= ~N~0 ~i~0)) (not (= (mod |thread2Thread1of1ForFork0_~cond~1#1| 256) 0))) (or (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (not (= (mod |thread2Thread1of1ForFork0_~cond~1#1| 256) 0)))), 313233#(or (< (+ ~j~0 1) ~M~0) (not (< ~j~0 ~M~0)) (< (+ ~i~0 1) ~N~0) (not (< ~i~0 ~N~0)))] [2022-03-15 19:13:14,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 19:13:14,324 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:13:14,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 19:13:14,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1046, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:13:14,325 INFO L87 Difference]: Start difference. First operand 8099 states and 34550 transitions. Second operand has 25 states, 25 states have (on average 6.92) internal successors, (173), 24 states have internal predecessors, (173), 0 states have call successors, (0), 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:13:15,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:13:15,811 INFO L93 Difference]: Finished difference Result 9258 states and 38324 transitions. [2022-03-15 19:13:15,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 19:13:15,811 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 6.92) internal successors, (173), 24 states have internal predecessors, (173), 0 states have call successors, (0), 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 35 [2022-03-15 19:13:15,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:13:15,835 INFO L225 Difference]: With dead ends: 9258 [2022-03-15 19:13:15,835 INFO L226 Difference]: Without dead ends: 8587 [2022-03-15 19:13:15,836 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 346 SyntacticMatches, 79 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2186 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=474, Invalid=2076, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 19:13:15,836 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 535 mSDsluCounter, 1447 mSDsCounter, 0 mSdLazyCounter, 2375 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 2425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:13:15,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [535 Valid, 38 Invalid, 2425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2375 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 19:13:15,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8587 states. [2022-03-15 19:13:15,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8587 to 7316. [2022-03-15 19:13:15,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7316 states, 7315 states have (on average 4.247983595352016) internal successors, (31074), 7315 states have internal predecessors, (31074), 0 states have call successors, (0), 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:13:16,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7316 states to 7316 states and 31074 transitions. [2022-03-15 19:13:16,009 INFO L78 Accepts]: Start accepts. Automaton has 7316 states and 31074 transitions. Word has length 35 [2022-03-15 19:13:16,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:13:16,010 INFO L470 AbstractCegarLoop]: Abstraction has 7316 states and 31074 transitions. [2022-03-15 19:13:16,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.92) internal successors, (173), 24 states have internal predecessors, (173), 0 states have call successors, (0), 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:13:16,010 INFO L276 IsEmpty]: Start isEmpty. Operand 7316 states and 31074 transitions. [2022-03-15 19:13:16,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:13:16,024 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:13:16,024 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:13:16,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 19:13:16,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:16,225 INFO L402 AbstractCegarLoop]: === Iteration 23 === 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:13:16,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:13:16,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1234820384, now seen corresponding path program 13 times [2022-03-15 19:13:16,228 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:13:16,228 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415123332] [2022-03-15 19:13:16,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:13:16,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:13:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:13:17,065 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:13:17,065 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:13:17,065 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415123332] [2022-03-15 19:13:17,065 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415123332] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:13:17,065 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49362119] [2022-03-15 19:13:17,065 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:13:17,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:17,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:13:17,067 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:13:17,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 19:13:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:13:17,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-15 19:13:17,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:13:17,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:13:17,503 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 30 treesize of output 30 [2022-03-15 19:13:17,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:13:17,559 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 30 treesize of output 30 [2022-03-15 19:13:17,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:13:17,612 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 30 treesize of output 30 [2022-03-15 19:13:17,710 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:13:17,710 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 46 treesize of output 12 [2022-03-15 19:13:17,758 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:13:17,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:13:17,861 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1509 (Array Int Int))) (<= 1 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1509) c_~q1~0.base)) (.cse1 (* c_~q1_front~0 4))) (+ (select .cse0 (+ .cse1 c_~q1~0.offset 4)) (select .cse0 (+ .cse1 c_~q1~0.offset)) c_~total~0)))) is different from false [2022-03-15 19:13:17,871 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1509 (Array Int Int)) (v_ArrVal_1508 (Array Int Int))) (<= 1 (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1508) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1509) c_~q1~0.base)) (.cse1 (* c_~q1_front~0 4))) (+ (select .cse0 (+ .cse1 c_~q1~0.offset 4)) (select .cse0 (+ .cse1 c_~q1~0.offset)) c_~total~0)))) is different from false [2022-03-15 19:13:17,882 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1509 (Array Int Int)) (v_ArrVal_1508 (Array Int Int)) (v_ArrVal_1507 (Array Int Int))) (<= 1 (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1507) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1508) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1509) c_~q1~0.base)) (.cse1 (* c_~q1_front~0 4))) (+ (select .cse0 (+ .cse1 c_~q1~0.offset)) (select .cse0 (+ .cse1 c_~q1~0.offset 4)) c_~total~0)))) is different from false [2022-03-15 19:13:17,969 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:13:17,969 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1903 treesize of output 1802 [2022-03-15 19:13:17,980 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:13:17,981 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 871 treesize of output 767 [2022-03-15 19:13:17,992 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:13:17,993 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 1638 treesize of output 1430 [2022-03-15 19:13:18,005 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:13:18,005 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 1430 treesize of output 1014 [2022-03-15 19:13:18,549 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2022-03-15 19:13:18,549 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49362119] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:13:18,549 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:13:18,549 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 32 [2022-03-15 19:13:18,549 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [724307829] [2022-03-15 19:13:18,549 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:13:18,555 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:13:18,952 INFO L252 McrAutomatonBuilder]: Finished intersection with 508 states and 1525 transitions. [2022-03-15 19:13:18,952 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:13:38,096 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [337401#(and (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (<= 0 ~q1_front~0)) (not (<= (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 2147483647)) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4))) (not (< ~q1_front~0 ~n1~0))) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 ~q1_front~0)) (not (<= (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 2147483647)) (not (< ~q1_front~0 ~n1~0))) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= ~q1~0.offset 0) (not (<= 0 ~q1_front~0)) (not (<= (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 2147483647)) (not (< ~q1_front~0 ~n1~0)))), 337399#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0)), 337400#(or (< 2147483647 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q1_front~0 0) (<= ~n1~0 (+ ~q1_front~0 1)) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0) (<= ~q1_back~0 (+ ~q1_front~0 1)) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0))] [2022-03-15 19:13:38,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:13:38,097 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:13:38,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:13:38,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=985, Unknown=3, NotChecked=198, Total=1332 [2022-03-15 19:13:38,097 INFO L87 Difference]: Start difference. First operand 7316 states and 31074 transitions. Second operand has 16 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 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:13:38,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:13:38,963 INFO L93 Difference]: Finished difference Result 12051 states and 50569 transitions. [2022-03-15 19:13:38,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 19:13:38,963 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 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 36 [2022-03-15 19:13:38,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:13:38,997 INFO L225 Difference]: With dead ends: 12051 [2022-03-15 19:13:38,998 INFO L226 Difference]: Without dead ends: 11943 [2022-03-15 19:13:38,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 504 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=176, Invalid=1239, Unknown=3, NotChecked=222, Total=1640 [2022-03-15 19:13:38,998 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 131 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:13:38,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 99 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:13:39,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11943 states. [2022-03-15 19:13:39,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11943 to 8405. [2022-03-15 19:13:39,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8405 states, 8404 states have (on average 4.221561161351738) internal successors, (35478), 8404 states have internal predecessors, (35478), 0 states have call successors, (0), 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:13:39,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8405 states to 8405 states and 35478 transitions. [2022-03-15 19:13:39,189 INFO L78 Accepts]: Start accepts. Automaton has 8405 states and 35478 transitions. Word has length 36 [2022-03-15 19:13:39,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:13:39,189 INFO L470 AbstractCegarLoop]: Abstraction has 8405 states and 35478 transitions. [2022-03-15 19:13:39,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 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:13:39,189 INFO L276 IsEmpty]: Start isEmpty. Operand 8405 states and 35478 transitions. [2022-03-15 19:13:39,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:13:39,206 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:13:39,206 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:13:39,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 19:13:39,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-03-15 19:13:39,407 INFO L402 AbstractCegarLoop]: === Iteration 24 === 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:13:39,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:13:39,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1726760490, now seen corresponding path program 14 times [2022-03-15 19:13:39,408 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:13:39,408 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844347810] [2022-03-15 19:13:39,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:13:39,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:13:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:13:40,200 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:13:40,200 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:13:40,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844347810] [2022-03-15 19:13:40,200 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844347810] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:13:40,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250531513] [2022-03-15 19:13:40,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:13:40,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:40,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:13:40,202 INFO L229 MonitoredProcess]: Starting monitored process 22 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:13:40,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 19:13:40,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:13:40,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:13:40,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 46 conjunts are in the unsatisfiable core [2022-03-15 19:13:40,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:13:40,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:13:40,677 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 30 treesize of output 30 [2022-03-15 19:13:40,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:13:40,726 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 30 treesize of output 30 [2022-03-15 19:13:40,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:13:40,805 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 42 treesize of output 40 [2022-03-15 19:13:40,848 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:13:40,848 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 46 treesize of output 12 [2022-03-15 19:13:40,884 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:13:40,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:13:40,942 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1584 (Array Int Int))) (<= 1 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1584) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) c_~total~0))) is different from false [2022-03-15 19:13:40,947 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1584 (Array Int Int))) (<= 1 (let ((.cse0 (* c_~q1_front~0 4))) (+ c_~total~0 (select (select |c_#memory_int| c_~q1~0.base) (+ .cse0 c_~q1~0.offset)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1584) c_~q1~0.base) (+ .cse0 c_~q1~0.offset 4)))))) is different from false [2022-03-15 19:13:40,965 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1584 (Array Int Int)) (v_ArrVal_1583 (Array Int Int))) (<= 1 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1583)) (.cse1 (* c_~q1_front~0 4))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1584) c_~q1~0.base) (+ .cse1 c_~q1~0.offset 4)) c_~total~0 (select (select .cse0 c_~q1~0.base) (+ .cse1 c_~q1~0.offset)))))) is different from false [2022-03-15 19:13:40,980 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1584 (Array Int Int)) (v_ArrVal_1583 (Array Int Int)) (v_ArrVal_1582 (Array Int Int))) (<= 1 (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1582) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1583)) (.cse1 (* c_~q1_front~0 4))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1584) c_~q1~0.base) (+ .cse1 c_~q1~0.offset 4)) c_~total~0 (select (select .cse0 c_~q1~0.base) (+ .cse1 c_~q1~0.offset)))))) is different from false [2022-03-15 19:13:41,077 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:13:41,077 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3823 treesize of output 3458 [2022-03-15 19:13:41,097 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 3398 treesize of output 2950 [2022-03-15 19:13:41,120 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:13:41,120 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 2950 treesize of output 2342 [2022-03-15 19:13:41,144 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:13:41,144 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 2342 treesize of output 2038 [2022-03-15 19:13:42,696 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 4 not checked. [2022-03-15 19:13:42,696 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250531513] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:13:42,696 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:13:42,696 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 33 [2022-03-15 19:13:42,696 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1540038382] [2022-03-15 19:13:42,697 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:13:42,701 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:13:42,919 INFO L252 McrAutomatonBuilder]: Finished intersection with 388 states and 1121 transitions. [2022-03-15 19:13:42,919 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:13:51,264 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [366516#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0))] [2022-03-15 19:13:51,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:13:51,265 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:13:51,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:13:51,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=875, Unknown=4, NotChecked=252, Total=1260 [2022-03-15 19:13:51,265 INFO L87 Difference]: Start difference. First operand 8405 states and 35478 transitions. Second operand has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 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:13:51,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:13:51,887 INFO L93 Difference]: Finished difference Result 11942 states and 50147 transitions. [2022-03-15 19:13:51,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 19:13:51,887 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 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 36 [2022-03-15 19:13:51,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:13:51,922 INFO L225 Difference]: With dead ends: 11942 [2022-03-15 19:13:51,922 INFO L226 Difference]: Without dead ends: 11857 [2022-03-15 19:13:51,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 382 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=141, Invalid=993, Unknown=4, NotChecked=268, Total=1406 [2022-03-15 19:13:51,923 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 115 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:13:51,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 98 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:13:51,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11857 states. [2022-03-15 19:13:52,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11857 to 8407. [2022-03-15 19:13:52,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8407 states, 8406 states have (on average 4.22246014751368) internal successors, (35494), 8406 states have internal predecessors, (35494), 0 states have call successors, (0), 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:13:52,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8407 states to 8407 states and 35494 transitions. [2022-03-15 19:13:52,156 INFO L78 Accepts]: Start accepts. Automaton has 8407 states and 35494 transitions. Word has length 36 [2022-03-15 19:13:52,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:13:52,156 INFO L470 AbstractCegarLoop]: Abstraction has 8407 states and 35494 transitions. [2022-03-15 19:13:52,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 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:13:52,156 INFO L276 IsEmpty]: Start isEmpty. Operand 8407 states and 35494 transitions. [2022-03-15 19:13:52,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:13:52,177 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:13:52,177 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:13:52,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 19:13:52,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-03-15 19:13:52,378 INFO L402 AbstractCegarLoop]: === Iteration 25 === 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:13:52,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:13:52,381 INFO L85 PathProgramCache]: Analyzing trace with hash 596086328, now seen corresponding path program 15 times [2022-03-15 19:13:52,382 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:13:52,382 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066767984] [2022-03-15 19:13:52,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:13:52,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:13:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:13:53,041 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:13:53,041 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:13:53,041 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066767984] [2022-03-15 19:13:53,041 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066767984] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:13:53,041 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285330219] [2022-03-15 19:13:53,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:13:53,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:13:53,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:13:53,042 INFO L229 MonitoredProcess]: Starting monitored process 23 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:13:53,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 19:13:53,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:13:53,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:13:53,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 19:13:53,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:13:53,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:13:53,436 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 18 treesize of output 20 [2022-03-15 19:13:53,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:13:53,489 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 18 treesize of output 20 [2022-03-15 19:13:53,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:13:53,534 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 18 treesize of output 20 [2022-03-15 19:13:53,651 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:13:53,652 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 46 treesize of output 12 [2022-03-15 19:13:53,682 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:13:53,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:13:53,814 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1659 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1659) c_~q1~0.base))) (or (not (<= c_~C~0 (select .cse0 (+ (* c_~q1_back~0 4) c_~q1~0.offset)))) (< 0 (let ((.cse1 (* c_~q1_front~0 4))) (+ (select .cse0 (+ .cse1 c_~q1~0.offset)) (select .cse0 (+ .cse1 c_~q1~0.offset 4)) c_~total~0)))))) is different from false [2022-03-15 19:13:53,827 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1659 (Array Int Int)) (v_ArrVal_1658 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1658) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1659) c_~q1~0.base))) (or (not (<= c_~C~0 (select .cse0 (+ (* c_~q1_back~0 4) c_~q1~0.offset)))) (< 0 (let ((.cse1 (* c_~q1_front~0 4))) (+ (select .cse0 (+ .cse1 c_~q1~0.offset)) c_~total~0 (select .cse0 (+ .cse1 c_~q1~0.offset 4)))))))) is different from false [2022-03-15 19:13:53,843 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1659 (Array Int Int)) (v_ArrVal_1658 (Array Int Int)) (v_ArrVal_1657 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1657) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1658) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1659) c_~q1~0.base))) (or (not (<= c_~C~0 (select .cse0 (+ (* c_~q1_back~0 4) c_~q1~0.offset)))) (< 0 (let ((.cse1 (* c_~q1_front~0 4))) (+ (select .cse0 (+ .cse1 c_~q1~0.offset 4)) (select .cse0 (+ .cse1 c_~q1~0.offset)) c_~total~0)))))) is different from false [2022-03-15 19:13:53,881 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:13:53,881 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 804 treesize of output 796 [2022-03-15 19:13:53,902 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:13:53,902 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 740 treesize of output 686 [2022-03-15 19:13:53,924 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:13:53,925 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 660 treesize of output 526 [2022-03-15 19:13:53,949 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:13:53,949 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 377 treesize of output 363 [2022-03-15 19:14:00,017 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:14:00,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285330219] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:14:00,017 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:14:00,017 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 30 [2022-03-15 19:14:00,018 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [537284361] [2022-03-15 19:14:00,018 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:14:00,022 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:14:00,211 INFO L252 McrAutomatonBuilder]: Finished intersection with 424 states and 1232 transitions. [2022-03-15 19:14:00,211 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:14:13,134 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [395523#(and (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_front~0)) (not (<= (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 2147483647))) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (not (< ~q1_front~0 ~q1_back~0)) (<= 2 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= ~n1~0 ~q1_back~0) (not (<= 0 ~q1_front~0)) (not (<= (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 2147483647)))), 395521#(or (< 2147483647 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= 2 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0)), 395522#(and (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= 2 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), 395520#(or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= 2 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0)), 395519#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= 2 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0))] [2022-03-15 19:14:13,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:14:13,135 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:14:13,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:14:13,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=986, Unknown=3, NotChecked=198, Total=1332 [2022-03-15 19:14:13,136 INFO L87 Difference]: Start difference. First operand 8407 states and 35494 transitions. Second operand has 18 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 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:14:14,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:14:14,482 INFO L93 Difference]: Finished difference Result 15870 states and 66197 transitions. [2022-03-15 19:14:14,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 19:14:14,483 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 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 36 [2022-03-15 19:14:14,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:14:14,532 INFO L225 Difference]: With dead ends: 15870 [2022-03-15 19:14:14,532 INFO L226 Difference]: Without dead ends: 15108 [2022-03-15 19:14:14,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 428 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=206, Invalid=1443, Unknown=3, NotChecked=240, Total=1892 [2022-03-15 19:14:14,533 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 230 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:14:14,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 177 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1333 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:14:14,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15108 states. [2022-03-15 19:14:14,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15108 to 9059. [2022-03-15 19:14:14,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9059 states, 9058 states have (on average 4.267829542945463) internal successors, (38658), 9058 states have internal predecessors, (38658), 0 states have call successors, (0), 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:14:14,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9059 states to 9059 states and 38658 transitions. [2022-03-15 19:14:14,777 INFO L78 Accepts]: Start accepts. Automaton has 9059 states and 38658 transitions. Word has length 36 [2022-03-15 19:14:14,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:14:14,777 INFO L470 AbstractCegarLoop]: Abstraction has 9059 states and 38658 transitions. [2022-03-15 19:14:14,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 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:14:14,777 INFO L276 IsEmpty]: Start isEmpty. Operand 9059 states and 38658 transitions. [2022-03-15 19:14:14,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:14:14,801 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:14:14,801 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:14:14,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-03-15 19:14:15,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:14:15,016 INFO L402 AbstractCegarLoop]: === Iteration 26 === 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:14:15,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:14:15,016 INFO L85 PathProgramCache]: Analyzing trace with hash 469764026, now seen corresponding path program 16 times [2022-03-15 19:14:15,017 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:14:15,017 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093185030] [2022-03-15 19:14:15,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:14:15,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:14:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:14:15,818 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:14:15,818 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:14:15,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093185030] [2022-03-15 19:14:15,818 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093185030] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:14:15,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923327539] [2022-03-15 19:14:15,818 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:14:15,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:14:15,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:14:15,820 INFO L229 MonitoredProcess]: Starting monitored process 24 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:14:15,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-15 19:14:15,995 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:14:15,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:14:15,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 56 conjunts are in the unsatisfiable core [2022-03-15 19:14:15,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:14:16,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:14:16,345 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 19 treesize of output 21 [2022-03-15 19:14:16,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:14:16,404 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 19 treesize of output 21 [2022-03-15 19:14:16,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:14:16,558 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 42 treesize of output 40 [2022-03-15 19:14:16,633 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:14:16,633 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 48 treesize of output 12 [2022-03-15 19:14:16,664 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:14:16,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:14:16,738 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1734 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1734) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) c_~total~0))) is different from false [2022-03-15 19:14:17,024 INFO L353 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2022-03-15 19:14:17,024 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1977 treesize of output 1798 [2022-03-15 19:14:17,046 INFO L353 Elim1Store]: treesize reduction 41, result has 22.6 percent of original size [2022-03-15 19:14:17,047 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1756 treesize of output 1450 [2022-03-15 19:14:17,057 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 1390 treesize of output 1166 [2022-03-15 19:14:17,076 INFO L353 Elim1Store]: treesize reduction 41, result has 22.6 percent of original size [2022-03-15 19:14:17,077 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1193 treesize of output 1046 [2022-03-15 19:15:10,419 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:15:10,419 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923327539] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:15:10,419 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:15:10,419 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 37 [2022-03-15 19:15:10,419 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [600226299] [2022-03-15 19:15:10,419 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:15:10,438 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:15:10,583 INFO L252 McrAutomatonBuilder]: Finished intersection with 376 states and 1089 transitions. [2022-03-15 19:15:10,583 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:15:18,386 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [429775#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= 2 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0))] [2022-03-15 19:15:18,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:15:18,386 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:15:18,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:15:18,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1294, Unknown=8, NotChecked=74, Total=1560 [2022-03-15 19:15:18,387 INFO L87 Difference]: Start difference. First operand 9059 states and 38658 transitions. Second operand has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 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:15:19,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:15:19,053 INFO L93 Difference]: Finished difference Result 12946 states and 54990 transitions. [2022-03-15 19:15:19,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:15:19,053 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 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 36 [2022-03-15 19:15:19,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:15:19,091 INFO L225 Difference]: With dead ends: 12946 [2022-03-15 19:15:19,091 INFO L226 Difference]: Without dead ends: 12643 [2022-03-15 19:15:19,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 371 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=193, Invalid=1363, Unknown=8, NotChecked=76, Total=1640 [2022-03-15 19:15:19,092 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 86 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:15:19,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 109 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:15:19,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12643 states. [2022-03-15 19:15:19,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12643 to 9087. [2022-03-15 19:15:19,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9087 states, 9086 states have (on average 4.269865727492846) internal successors, (38796), 9086 states have internal predecessors, (38796), 0 states have call successors, (0), 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:15:19,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9087 states to 9087 states and 38796 transitions. [2022-03-15 19:15:19,304 INFO L78 Accepts]: Start accepts. Automaton has 9087 states and 38796 transitions. Word has length 36 [2022-03-15 19:15:19,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:15:19,304 INFO L470 AbstractCegarLoop]: Abstraction has 9087 states and 38796 transitions. [2022-03-15 19:15:19,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 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:15:19,304 INFO L276 IsEmpty]: Start isEmpty. Operand 9087 states and 38796 transitions. [2022-03-15 19:15:19,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 19:15:19,323 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:15:19,323 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:15:19,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-03-15 19:15:19,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:15:19,528 INFO L402 AbstractCegarLoop]: === Iteration 27 === 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:15:19,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:15:19,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1381811750, now seen corresponding path program 17 times [2022-03-15 19:15:19,533 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:15:19,533 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817205877] [2022-03-15 19:15:19,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:15:19,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:15:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:15:21,463 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:15:21,463 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:15:21,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817205877] [2022-03-15 19:15:21,464 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817205877] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:15:21,464 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163996829] [2022-03-15 19:15:21,464 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:15:21,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:15:21,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:15:21,468 INFO L229 MonitoredProcess]: Starting monitored process 25 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:15:21,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-15 19:15:21,640 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:15:21,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:15:21,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 19:15:21,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:15:21,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:15:21,987 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 30 treesize of output 30 [2022-03-15 19:15:22,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:15:22,039 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 30 treesize of output 30 [2022-03-15 19:15:22,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:15:22,088 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 30 treesize of output 30 [2022-03-15 19:15:22,178 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:15:22,178 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 46 treesize of output 12 [2022-03-15 19:15:22,213 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:15:22,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:15:22,318 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1813 (Array Int Int))) (< 0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1813) c_~q1~0.base)) (.cse1 (* c_~q1_front~0 4))) (+ (select .cse0 (+ .cse1 c_~q1~0.offset 4)) c_~total~0 (select .cse0 (+ .cse1 c_~q1~0.offset)))))) is different from false [2022-03-15 19:15:22,325 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1813 (Array Int Int)) (v_ArrVal_1812 (Array Int Int))) (< 0 (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1812) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1813) c_~q1~0.base)) (.cse1 (* c_~q1_front~0 4))) (+ (select .cse0 (+ .cse1 c_~q1~0.offset)) c_~total~0 (select .cse0 (+ .cse1 c_~q1~0.offset 4)))))) is different from false [2022-03-15 19:15:22,333 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1813 (Array Int Int)) (v_ArrVal_1812 (Array Int Int)) (v_ArrVal_1811 (Array Int Int))) (< 0 (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1811) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1812) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1813) c_~q1~0.base)) (.cse1 (* c_~q1_front~0 4))) (+ (select .cse0 (+ .cse1 c_~q1~0.offset 4)) (select .cse0 (+ .cse1 c_~q1~0.offset)) c_~total~0)))) is different from false [2022-03-15 19:15:22,414 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:15:22,414 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1903 treesize of output 1802 [2022-03-15 19:15:22,426 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:15:22,427 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 1742 treesize of output 1638 [2022-03-15 19:15:22,437 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:15:22,438 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 1638 treesize of output 1222 [2022-03-15 19:15:22,448 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:15:22,449 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 1222 treesize of output 1014 [2022-03-15 19:15:24,332 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 2 not checked. [2022-03-15 19:15:24,332 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163996829] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:15:24,332 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:15:24,332 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 10] total 34 [2022-03-15 19:15:24,332 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1933831156] [2022-03-15 19:15:24,333 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:15:24,337 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:15:24,610 INFO L252 McrAutomatonBuilder]: Finished intersection with 509 states and 1526 transitions. [2022-03-15 19:15:24,610 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:15:42,442 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [461151#(or (< 2147483647 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q1_front~0 0) (<= 2 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 (+ ~q1_front~0 1)) (< (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0) (<= ~q1_back~0 (+ ~q1_front~0 1)) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0)), 461152#(and (or (not (< ~q1_front~0 ~q1_back~0)) (<= (+ (* ~q1_back~0 4) ~q1~0.offset) (+ 7 (* ~q1_front~0 4))) (<= 2 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (<= 0 (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (<= 0 ~q1_front~0)) (not (<= (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 2147483647)) (not (< ~q1_front~0 ~n1~0))) (or (not (< ~q1_front~0 ~q1_back~0)) (not (<= 0 (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= ~q1~0.offset 0) (not (<= 0 ~q1_front~0)) (not (<= (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 2147483647)) (not (< ~q1_front~0 ~n1~0)))), 461150#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= 2 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0))] [2022-03-15 19:15:42,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:15:42,443 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:15:42,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:15:42,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1136, Unknown=3, NotChecked=210, Total=1482 [2022-03-15 19:15:42,444 INFO L87 Difference]: Start difference. First operand 9087 states and 38796 transitions. Second operand has 17 states, 16 states have (on average 4.875) internal successors, (78), 16 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:15:43,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:15:43,495 INFO L93 Difference]: Finished difference Result 13325 states and 55874 transitions. [2022-03-15 19:15:43,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 19:15:43,495 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.875) internal successors, (78), 16 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-03-15 19:15:43,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:15:43,538 INFO L225 Difference]: With dead ends: 13325 [2022-03-15 19:15:43,538 INFO L226 Difference]: Without dead ends: 13234 [2022-03-15 19:15:43,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 502 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=162, Invalid=1329, Unknown=3, NotChecked=228, Total=1722 [2022-03-15 19:15:43,539 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 144 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:15:43,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 99 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:15:43,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13234 states. [2022-03-15 19:15:43,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13234 to 9830. [2022-03-15 19:15:43,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9830 states, 9829 states have (on average 4.251704140807814) internal successors, (41790), 9829 states have internal predecessors, (41790), 0 states have call successors, (0), 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:15:43,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9830 states to 9830 states and 41790 transitions. [2022-03-15 19:15:43,774 INFO L78 Accepts]: Start accepts. Automaton has 9830 states and 41790 transitions. Word has length 37 [2022-03-15 19:15:43,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:15:43,774 INFO L470 AbstractCegarLoop]: Abstraction has 9830 states and 41790 transitions. [2022-03-15 19:15:43,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.875) internal successors, (78), 16 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:15:43,774 INFO L276 IsEmpty]: Start isEmpty. Operand 9830 states and 41790 transitions. [2022-03-15 19:15:43,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 19:15:43,794 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:15:43,794 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:15:43,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-15 19:15:43,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-15 19:15:43,995 INFO L402 AbstractCegarLoop]: === Iteration 28 === 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:15:43,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:15:43,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1579769124, now seen corresponding path program 18 times [2022-03-15 19:15:43,996 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:15:43,996 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330859140] [2022-03-15 19:15:43,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:15:43,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:15:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:15:45,520 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:15:45,520 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:15:45,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330859140] [2022-03-15 19:15:45,521 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330859140] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:15:45,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228973799] [2022-03-15 19:15:45,521 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:15:45,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:15:45,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:15:45,522 INFO L229 MonitoredProcess]: Starting monitored process 26 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:15:45,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-15 19:15:45,759 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:15:45,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:15:45,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 19:15:45,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:15:46,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:15:46,077 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 30 treesize of output 30 [2022-03-15 19:15:46,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:15:46,139 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 30 treesize of output 30 [2022-03-15 19:15:46,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:15:46,241 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 42 treesize of output 40 [2022-03-15 19:15:46,301 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:15:46,301 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 46 treesize of output 12 [2022-03-15 19:15:46,341 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:15:46,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:15:46,699 INFO L353 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2022-03-15 19:15:46,700 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1919 treesize of output 1740 [2022-03-15 19:15:46,712 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:15:46,712 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 1694 treesize of output 1390 [2022-03-15 19:15:46,724 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:15:46,725 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 1390 treesize of output 1238 [2022-03-15 19:15:46,734 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 1238 treesize of output 1014 [2022-03-15 19:15:49,471 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:15:49,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228973799] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:15:49,471 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:15:49,471 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 10] total 36 [2022-03-15 19:15:49,471 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [71925285] [2022-03-15 19:15:49,471 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:15:49,476 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:15:49,661 INFO L252 McrAutomatonBuilder]: Finished intersection with 389 states and 1122 transitions. [2022-03-15 19:15:49,661 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:16:00,475 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [494398#(or (<= 1 ~total~0) (not (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0))), 494399#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0) (<= (+ ~q1_front~0 2) ~q1_back~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 494400#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0) (<= (+ ~q1_front~0 2) ~q1_back~0))] [2022-03-15 19:16:00,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:16:00,475 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:16:00,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:16:00,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1444, Unknown=3, NotChecked=0, Total=1640 [2022-03-15 19:16:00,476 INFO L87 Difference]: Start difference. First operand 9830 states and 41790 transitions. Second operand has 20 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 19 states have internal predecessors, (100), 0 states have call successors, (0), 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:16:01,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:16:01,740 INFO L93 Difference]: Finished difference Result 15107 states and 63146 transitions. [2022-03-15 19:16:01,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:16:01,740 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 19 states have internal predecessors, (100), 0 states have call successors, (0), 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 37 [2022-03-15 19:16:01,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:16:01,784 INFO L225 Difference]: With dead ends: 15107 [2022-03-15 19:16:01,784 INFO L226 Difference]: Without dead ends: 14908 [2022-03-15 19:16:01,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 345 SyntacticMatches, 43 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1023 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=281, Invalid=2068, Unknown=3, NotChecked=0, Total=2352 [2022-03-15 19:16:01,785 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 223 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:16:01,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 160 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:16:01,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14908 states. [2022-03-15 19:16:01,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14908 to 9550. [2022-03-15 19:16:01,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9550 states, 9549 states have (on average 4.250706880301602) internal successors, (40590), 9549 states have internal predecessors, (40590), 0 states have call successors, (0), 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:16:02,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9550 states to 9550 states and 40590 transitions. [2022-03-15 19:16:02,013 INFO L78 Accepts]: Start accepts. Automaton has 9550 states and 40590 transitions. Word has length 37 [2022-03-15 19:16:02,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:16:02,013 INFO L470 AbstractCegarLoop]: Abstraction has 9550 states and 40590 transitions. [2022-03-15 19:16:02,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 19 states have internal predecessors, (100), 0 states have call successors, (0), 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:16:02,014 INFO L276 IsEmpty]: Start isEmpty. Operand 9550 states and 40590 transitions. [2022-03-15 19:16:02,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 19:16:02,084 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:16:02,084 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:16:02,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-15 19:16:02,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-15 19:16:02,285 INFO L402 AbstractCegarLoop]: === Iteration 29 === 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:16:02,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:16:02,286 INFO L85 PathProgramCache]: Analyzing trace with hash 743077694, now seen corresponding path program 19 times [2022-03-15 19:16:02,286 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:16:02,286 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191529466] [2022-03-15 19:16:02,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:16:02,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:16:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:16:03,313 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:16:03,314 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:16:03,314 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191529466] [2022-03-15 19:16:03,314 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191529466] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:16:03,314 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229795198] [2022-03-15 19:16:03,314 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:16:03,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:16:03,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:16:03,315 INFO L229 MonitoredProcess]: Starting monitored process 27 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:16:03,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-15 19:16:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:16:03,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 19:16:03,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:16:03,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:16:03,775 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 18 treesize of output 20 [2022-03-15 19:16:03,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:16:03,833 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:16:03,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:16:03,882 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 18 treesize of output 20 [2022-03-15 19:16:04,007 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:16:04,007 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 46 treesize of output 12 [2022-03-15 19:16:04,040 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:16:04,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:16:04,185 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1971 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1971) c_~q1~0.base))) (or (< 0 (let ((.cse1 (* c_~q1_front~0 4))) (+ (select .cse0 (+ .cse1 c_~q1~0.offset 4)) (select .cse0 (+ .cse1 c_~q1~0.offset)) c_~total~0))) (not (<= c_~C~0 (select .cse0 (+ (* c_~q1_back~0 4) c_~q1~0.offset))))))) is different from false [2022-03-15 19:16:04,198 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1971 (Array Int Int)) (v_ArrVal_1970 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1970) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1971) c_~q1~0.base))) (or (< 0 (let ((.cse1 (* c_~q1_front~0 4))) (+ (select .cse0 (+ .cse1 c_~q1~0.offset 4)) (select .cse0 (+ .cse1 c_~q1~0.offset)) c_~total~0))) (not (<= c_~C~0 (select .cse0 (+ (* c_~q1_back~0 4) c_~q1~0.offset))))))) is different from false [2022-03-15 19:16:04,212 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1971 (Array Int Int)) (v_ArrVal_1970 (Array Int Int)) (v_ArrVal_1969 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1969) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1970) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1971) c_~q1~0.base))) (or (not (<= c_~C~0 (select .cse0 (+ (* c_~q1_back~0 4) c_~q1~0.offset)))) (< 0 (let ((.cse1 (* c_~q1_front~0 4))) (+ (select .cse0 (+ .cse1 c_~q1~0.offset)) c_~total~0 (select .cse0 (+ .cse1 c_~q1~0.offset 4)))))))) is different from false [2022-03-15 19:16:04,248 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:16:04,248 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 398 treesize of output 416 [2022-03-15 19:16:04,273 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:16:04,274 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 360 treesize of output 306 [2022-03-15 19:16:04,294 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:16:04,295 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 280 treesize of output 266 [2022-03-15 19:16:04,316 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:16:04,316 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 181 treesize of output 187 [2022-03-15 19:16:06,582 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:16:06,583 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229795198] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:16:06,583 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:16:06,583 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 10] total 36 [2022-03-15 19:16:06,583 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1082563472] [2022-03-15 19:16:06,583 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:16:06,587 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:16:06,778 INFO L252 McrAutomatonBuilder]: Finished intersection with 425 states and 1233 transitions. [2022-03-15 19:16:06,778 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:16:20,725 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [528886#(and (or (< 2147483647 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0)) (or (< 2147483647 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= 2 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0) (<= (+ ~q1_front~0 2) ~q1_back~0))), 528878#(or (not (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (<= 2 ~total~0)), 528885#(and (or (< 2147483647 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= 2 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0) (<= (+ ~q1_front~0 2) ~q1_back~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (or (< 2147483647 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0))), 528880#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= 2 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0) (<= (+ ~q1_front~0 2) ~q1_back~0)), 528884#(and (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= 2 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), 528883#(or (< 2147483647 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= 2 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0) (<= (+ ~q1_front~0 2) ~q1_back~0)), 528879#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= 2 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0) (<= (+ ~q1_front~0 2) ~q1_back~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 528881#(or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= (+ ~q1_back~0 1) ~q1_front~0) (<= 2 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= ~n1~0 ~q1_back~0) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0) (< ~q1_back~0 0)), 528882#(or (< 2147483647 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= 2 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_back~0) (< (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0) (< (+ ~total~0 2147483648 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) 0) (<= (+ ~q1_front~0 2) ~q1_back~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0))] [2022-03-15 19:16:20,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 19:16:20,726 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:16:20,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 19:16:20,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1703, Unknown=3, NotChecked=258, Total=2162 [2022-03-15 19:16:20,727 INFO L87 Difference]: Start difference. First operand 9550 states and 40590 transitions. Second operand has 25 states, 24 states have (on average 5.708333333333333) internal successors, (137), 24 states have internal predecessors, (137), 0 states have call successors, (0), 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:16:24,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:16:24,128 INFO L93 Difference]: Finished difference Result 19878 states and 82557 transitions. [2022-03-15 19:16:24,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 19:16:24,128 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 5.708333333333333) internal successors, (137), 24 states have internal predecessors, (137), 0 states have call successors, (0), 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 37 [2022-03-15 19:16:24,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:16:24,186 INFO L225 Difference]: With dead ends: 19878 [2022-03-15 19:16:24,187 INFO L226 Difference]: Without dead ends: 18881 [2022-03-15 19:16:24,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 390 SyntacticMatches, 35 SemanticMatches, 68 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=502, Invalid=3929, Unknown=3, NotChecked=396, Total=4830 [2022-03-15 19:16:24,188 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 355 mSDsluCounter, 1382 mSDsCounter, 0 mSdLazyCounter, 2532 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 2608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 2532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:16:24,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [355 Valid, 380 Invalid, 2608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 2532 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 19:16:24,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18881 states. [2022-03-15 19:16:24,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18881 to 10068. [2022-03-15 19:16:24,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10068 states, 10067 states have (on average 4.341313201549617) internal successors, (43704), 10067 states have internal predecessors, (43704), 0 states have call successors, (0), 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:16:24,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10068 states to 10068 states and 43704 transitions. [2022-03-15 19:16:24,564 INFO L78 Accepts]: Start accepts. Automaton has 10068 states and 43704 transitions. Word has length 37 [2022-03-15 19:16:24,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:16:24,565 INFO L470 AbstractCegarLoop]: Abstraction has 10068 states and 43704 transitions. [2022-03-15 19:16:24,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 5.708333333333333) internal successors, (137), 24 states have internal predecessors, (137), 0 states have call successors, (0), 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:16:24,565 INFO L276 IsEmpty]: Start isEmpty. Operand 10068 states and 43704 transitions. [2022-03-15 19:16:24,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 19:16:24,585 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:16:24,585 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:16:24,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-15 19:16:24,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 19:16:24,786 INFO L402 AbstractCegarLoop]: === Iteration 30 === 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:16:24,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:16:24,787 INFO L85 PathProgramCache]: Analyzing trace with hash 616755392, now seen corresponding path program 20 times [2022-03-15 19:16:24,787 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:16:24,787 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403502468] [2022-03-15 19:16:24,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:16:24,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:16:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:16:25,892 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:16:25,892 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:16:25,892 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403502468] [2022-03-15 19:16:25,892 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403502468] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:16:25,892 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398028650] [2022-03-15 19:16:25,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:16:25,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:16:25,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:16:25,894 INFO L229 MonitoredProcess]: Starting monitored process 28 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:16:25,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-15 19:16:26,109 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:16:26,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:16:26,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 19:16:26,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:16:26,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:16:26,412 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 19 treesize of output 21 [2022-03-15 19:16:26,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:16:26,467 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 19 treesize of output 21 [2022-03-15 19:16:26,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:16:26,600 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 42 treesize of output 40 [2022-03-15 19:16:26,654 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:16:26,655 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 46 treesize of output 12 [2022-03-15 19:16:26,686 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:16:26,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:16:26,762 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2050 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2050) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) c_~total~0))) is different from false [2022-03-15 19:16:26,858 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2050 (Array Int Int)) (v_ArrVal_2049 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2049))) (let ((.cse2 (select .cse0 c_~q1~0.base))) (or (< 0 (let ((.cse1 (* c_~q1_front~0 4))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2050) c_~q1~0.base) (+ .cse1 c_~q1~0.offset 4)) (select .cse2 (+ .cse1 c_~q1~0.offset)) c_~total~0))) (not (<= c_~C~0 (select .cse2 (+ (* c_~q1_back~0 4) c_~q1~0.offset)))))))) is different from false [2022-03-15 19:16:26,875 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2050 (Array Int Int)) (v_ArrVal_2049 (Array Int Int)) (v_ArrVal_2048 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2048) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2049))) (let ((.cse2 (select .cse0 c_~q1~0.base))) (or (< 0 (let ((.cse1 (* c_~q1_front~0 4))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2050) c_~q1~0.base) (+ .cse1 c_~q1~0.offset 4)) (select .cse2 (+ .cse1 c_~q1~0.offset)) c_~total~0))) (not (<= c_~C~0 (select .cse2 (+ (* c_~q1_back~0 4) c_~q1~0.offset)))))))) is different from false [2022-03-15 19:16:26,919 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:16:26,920 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 30628 treesize of output 27454 [2022-03-15 19:16:26,983 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 27254 treesize of output 23670 [2022-03-15 19:16:27,087 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:16:27,088 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 23814 treesize of output 21394 [2022-03-15 19:16:27,172 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:16:27,173 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 21368 treesize of output 16502 Received shutdown request... [2022-03-15 19:16:38,318 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-03-15 19:16:38,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-03-15 19:16:38,361 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:16:38,361 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:16:38,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:16:38,531 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2022-03-15 19:16:38,533 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 5 remaining) [2022-03-15 19:16:38,533 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 5 remaining) [2022-03-15 19:16:38,533 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 5 remaining) [2022-03-15 19:16:38,533 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATION (0 of 5 remaining) [2022-03-15 19:16:38,535 INFO L732 BasicCegarLoop]: Path program histogram: [20, 2, 2, 1, 1, 1, 1, 1, 1] [2022-03-15 19:16:38,537 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 19:16:38,537 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 19:16:38,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 07:16:38 BasicIcfg [2022-03-15 19:16:38,538 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 19:16:38,539 INFO L158 Benchmark]: Toolchain (without parser) took 722333.98ms. Allocated memory was 182.5MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 126.1MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-03-15 19:16:38,539 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory is still 142.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 19:16:38,540 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.45ms. Allocated memory was 182.5MB in the beginning and 238.0MB in the end (delta: 55.6MB). Free memory was 125.9MB in the beginning and 207.3MB in the end (delta: -81.4MB). Peak memory consumption was 6.4MB. Max. memory is 8.0GB. [2022-03-15 19:16:38,541 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.84ms. Allocated memory is still 238.0MB. Free memory was 207.3MB in the beginning and 204.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 19:16:38,541 INFO L158 Benchmark]: Boogie Preprocessor took 54.63ms. Allocated memory is still 238.0MB. Free memory was 204.7MB in the beginning and 202.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:16:38,541 INFO L158 Benchmark]: RCFGBuilder took 779.95ms. Allocated memory is still 238.0MB. Free memory was 202.6MB in the beginning and 163.8MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2022-03-15 19:16:38,541 INFO L158 Benchmark]: TraceAbstraction took 721134.97ms. Allocated memory was 238.0MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 163.8MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-03-15 19:16:38,542 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.12ms. Allocated memory is still 182.5MB. Free memory is still 142.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 302.45ms. Allocated memory was 182.5MB in the beginning and 238.0MB in the end (delta: 55.6MB). Free memory was 125.9MB in the beginning and 207.3MB in the end (delta: -81.4MB). Peak memory consumption was 6.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.84ms. Allocated memory is still 238.0MB. Free memory was 207.3MB in the beginning and 204.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.63ms. Allocated memory is still 238.0MB. Free memory was 204.7MB in the beginning and 202.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 779.95ms. Allocated memory is still 238.0MB. Free memory was 202.6MB in the beginning and 163.8MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * TraceAbstraction took 721134.97ms. Allocated memory was 238.0MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 163.8MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.7s, 239 PlacesBefore, 47 PlacesAfterwards, 245 TransitionsBefore, 40 TransitionsAfterwards, 1824 CoEnabledTransitionPairs, 8 FixpointIterations, 160 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 32 TrivialYvCompositions, 8 ConcurrentYvCompositions, 13 ChoiceCompositions, 240 TotalNumberOfCompositions, 3213 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2516, positive: 2432, positive conditional: 0, positive unconditional: 2432, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 945, positive: 926, positive conditional: 0, positive unconditional: 926, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2516, positive: 1506, positive conditional: 0, positive unconditional: 1506, negative: 65, negative conditional: 0, negative unconditional: 65, unknown: 945, unknown conditional: 0, unknown unconditional: 945] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 112, Positive conditional cache size: 0, Positive unconditional cache size: 112, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8 - 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: 150]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 143]: 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 38 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 140]: 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 38 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 142]: 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 38 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 141]: 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 38 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 259 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 721.0s, OverallIterations: 30, TraceHistogramMax: 5, PathProgramHistogramMax: 20, EmptinessCheckTime: 0.5s, AutomataDifference: 26.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.8s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5306 SdHoareTripleChecker+Valid, 13.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5306 mSDsluCounter, 2476 SdHoareTripleChecker+Invalid, 11.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12184 mSDsCounter, 1053 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22316 IncrementalHoareTripleChecker+Invalid, 23369 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1053 mSolverCounterUnsat, 311 mSDtfsCounter, 22316 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12279 GetRequests, 10761 SyntacticMatches, 568 SemanticMatches, 950 ConstructedPredicates, 27 IntricatePredicates, 0 DeprecatedPredicates, 15567 ImplicationChecksByTransitivity, 30.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11165occurred in iteration=18, InterpolantAutomatonStates: 423, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.6s AutomataMinimizationTime, 29 MinimizatonAttempts, 80733 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 3.5s SatisfiabilityAnalysisTime, 406.0s InterpolantComputationTime, 1866 NumberOfCodeBlocks, 1862 NumberOfCodeBlocksAsserted, 76 NumberOfCheckSat, 2613 ConstructedInterpolants, 148 QuantifiedInterpolants, 45802 SizeOfPredicates, 695 NumberOfNonLiveVariables, 10231 ConjunctsInSsa, 884 ConjunctsInUnsatCore, 79 InterpolantComputations, 7 PerfectInterpolantSequences, 220/727 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