/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/pthread/stack_longer-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 17:33:48,470 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 17:33:48,472 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 17:33:48,532 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 17:33:48,532 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 17:33:48,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 17:33:48,537 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 17:33:48,540 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 17:33:48,541 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 17:33:48,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 17:33:48,545 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 17:33:48,546 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 17:33:48,547 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 17:33:48,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 17:33:48,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 17:33:48,552 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 17:33:48,554 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 17:33:48,554 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 17:33:48,556 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 17:33:48,561 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 17:33:48,562 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 17:33:48,563 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 17:33:48,564 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 17:33:48,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 17:33:48,571 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 17:33:48,571 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 17:33:48,571 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 17:33:48,572 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 17:33:48,572 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 17:33:48,573 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 17:33:48,573 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 17:33:48,574 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 17:33:48,575 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 17:33:48,576 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 17:33:48,577 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 17:33:48,577 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 17:33:48,577 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 17:33:48,578 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 17:33:48,578 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 17:33:48,578 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 17:33:48,579 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 17:33:48,580 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 17:33:48,607 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 17:33:48,607 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 17:33:48,609 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 17:33:48,609 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 17:33:48,609 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 17:33:48,609 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 17:33:48,610 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 17:33:48,610 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 17:33:48,610 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 17:33:48,610 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 17:33:48,611 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 17:33:48,611 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 17:33:48,611 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 17:33:48,611 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 17:33:48,611 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 17:33:48,611 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 17:33:48,611 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 17:33:48,612 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 17:33:48,612 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 17:33:48,612 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 17:33:48,612 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 17:33:48,612 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 17:33:48,612 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 17:33:48,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 17:33:48,612 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 17:33:48,613 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 17:33:48,613 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 17:33:48,614 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 17:33:48,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 17:33:48,614 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 17:33:48,614 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 17:33:48,614 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 17:33:48,614 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 17:33:48,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 17:33:48,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 17:33:48,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 17:33:48,836 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 17:33:48,838 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 17:33:48,838 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longer-2.i [2022-03-15 17:33:48,895 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbde07bc4/311933b9d05541c19f17e78ae692ace5/FLAG49c764a35 [2022-03-15 17:33:49,356 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 17:33:49,356 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-2.i [2022-03-15 17:33:49,372 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbde07bc4/311933b9d05541c19f17e78ae692ace5/FLAG49c764a35 [2022-03-15 17:33:49,709 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbde07bc4/311933b9d05541c19f17e78ae692ace5 [2022-03-15 17:33:49,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 17:33:49,712 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 17:33:49,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 17:33:49,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 17:33:49,716 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 17:33:49,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 05:33:49" (1/1) ... [2022-03-15 17:33:49,717 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71ae6217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:33:49, skipping insertion in model container [2022-03-15 17:33:49,717 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 05:33:49" (1/1) ... [2022-03-15 17:33:49,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 17:33:49,753 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 17:33:50,164 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-2.i[41529,41542] [2022-03-15 17:33:50,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 17:33:50,212 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 17:33:50,255 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-2.i[41529,41542] [2022-03-15 17:33:50,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 17:33:50,330 INFO L208 MainTranslator]: Completed translation [2022-03-15 17:33:50,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:33:50 WrapperNode [2022-03-15 17:33:50,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 17:33:50,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 17:33:50,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 17:33:50,332 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 17:33:50,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:33:50" (1/1) ... [2022-03-15 17:33:50,369 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:33:50" (1/1) ... [2022-03-15 17:33:50,403 INFO L137 Inliner]: procedures = 277, calls = 40, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 150 [2022-03-15 17:33:50,404 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 17:33:50,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 17:33:50,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 17:33:50,405 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 17:33:50,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:33:50" (1/1) ... [2022-03-15 17:33:50,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:33:50" (1/1) ... [2022-03-15 17:33:50,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:33:50" (1/1) ... [2022-03-15 17:33:50,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:33:50" (1/1) ... [2022-03-15 17:33:50,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:33:50" (1/1) ... [2022-03-15 17:33:50,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:33:50" (1/1) ... [2022-03-15 17:33:50,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:33:50" (1/1) ... [2022-03-15 17:33:50,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 17:33:50,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 17:33:50,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 17:33:50,449 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 17:33:50,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:33:50" (1/1) ... [2022-03-15 17:33:50,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 17:33:50,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:33:50,475 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 17:33:50,495 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 17:33:50,510 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-03-15 17:33:50,510 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-03-15 17:33:50,510 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-03-15 17:33:50,511 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-03-15 17:33:50,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 17:33:50,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 17:33:50,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 17:33:50,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 17:33:50,511 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-15 17:33:50,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 17:33:50,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 17:33:50,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 17:33:50,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 17:33:50,513 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 17:33:50,608 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 17:33:50,609 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 17:33:50,825 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 17:33:50,833 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 17:33:50,833 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-15 17:33:50,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 05:33:50 BoogieIcfgContainer [2022-03-15 17:33:50,835 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 17:33:50,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 17:33:50,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 17:33:50,840 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 17:33:50,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 05:33:49" (1/3) ... [2022-03-15 17:33:50,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bcc306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 05:33:50, skipping insertion in model container [2022-03-15 17:33:50,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:33:50" (2/3) ... [2022-03-15 17:33:50,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bcc306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 05:33:50, skipping insertion in model container [2022-03-15 17:33:50,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 05:33:50" (3/3) ... [2022-03-15 17:33:50,842 INFO L111 eAbstractionObserver]: Analyzing ICFG stack_longer-2.i [2022-03-15 17:33:50,846 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 17:33:50,846 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 17:33:50,846 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-15 17:33:50,846 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 17:33:50,913 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,913 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,913 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,913 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,914 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,914 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,914 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,914 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,914 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,915 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,915 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,915 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,915 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,915 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,915 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,916 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,916 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,916 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,917 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,917 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,917 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,917 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,917 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,918 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,918 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,918 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,918 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,918 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,918 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,919 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,919 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,919 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,919 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,919 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,920 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,920 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,920 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,920 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,920 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,920 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,921 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,921 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,921 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,921 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,921 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,921 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,922 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,922 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,922 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,922 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,923 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,923 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,923 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,923 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,924 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,924 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,924 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,924 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,924 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,924 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,924 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,924 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,925 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,925 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,925 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,925 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,925 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,925 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,925 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,926 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,926 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,926 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,926 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,926 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,926 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,926 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,927 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,927 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,931 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,931 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,932 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,938 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,938 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,939 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,939 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,939 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,939 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,939 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,941 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,941 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,941 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,942 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,942 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,942 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,942 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,943 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,943 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,943 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,943 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,944 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,944 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,944 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,945 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,945 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,945 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,945 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,945 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,945 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,945 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,946 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,946 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,946 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,946 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,946 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,947 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,947 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,947 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,947 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,947 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,947 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,948 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,948 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,948 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,948 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,948 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,948 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,949 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,949 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,949 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,949 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,949 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,949 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,950 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,950 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,950 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,950 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,959 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,959 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,959 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,959 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,960 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,960 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,960 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,960 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,960 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,960 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,961 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,961 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,961 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,961 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,961 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,962 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,962 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,962 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,962 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,962 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,963 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,963 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,963 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,963 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,964 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,964 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,964 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,964 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,964 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,965 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,965 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,965 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,965 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,965 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,965 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,965 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,966 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,966 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,966 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,966 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,966 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,966 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,966 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,966 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,967 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,967 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,967 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,967 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,967 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,967 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,967 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,967 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,968 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,968 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,968 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,968 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,968 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,968 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,969 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,969 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,969 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,969 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,969 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,969 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,969 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,970 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,970 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,970 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,970 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,970 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,970 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,970 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,971 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,979 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,981 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,981 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,981 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,981 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,981 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,990 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,990 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,990 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,991 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,991 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,991 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,991 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,991 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,991 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,992 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,992 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,992 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,992 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,992 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,993 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,993 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,993 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,994 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,994 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,994 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,994 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,994 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,994 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,995 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,995 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,995 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,995 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,996 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,996 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,996 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,996 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:50,999 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,000 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,000 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,000 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,000 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,000 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,000 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,000 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,001 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,001 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,001 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,001 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,001 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,001 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,001 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,001 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,002 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,002 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,002 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,002 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,002 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,002 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,002 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,017 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,018 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,018 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,018 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,018 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,018 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,018 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,018 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,019 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,019 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,019 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,019 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,019 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,019 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,019 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,019 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,019 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,020 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:33:51,023 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 17:33:51,073 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 17:33:51,086 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 17:33:51,086 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-03-15 17:33:51,101 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 17:33:51,109 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 172 transitions, 360 flow [2022-03-15 17:33:51,111 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 172 transitions, 360 flow [2022-03-15 17:33:51,112 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 169 places, 172 transitions, 360 flow [2022-03-15 17:33:51,165 INFO L129 PetriNetUnfolder]: 10/170 cut-off events. [2022-03-15 17:33:51,165 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 17:33:51,171 INFO L84 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 170 events. 10/170 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 417 event pairs, 0 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 126. Up to 3 conditions per place. [2022-03-15 17:33:51,177 INFO L116 LiptonReduction]: Number of co-enabled transitions 8324 [2022-03-15 17:33:54,998 INFO L131 LiptonReduction]: Checked pairs total: 11337 [2022-03-15 17:33:54,998 INFO L133 LiptonReduction]: Total number of compositions: 165 [2022-03-15 17:33:55,006 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 37 transitions, 90 flow [2022-03-15 17:33:55,077 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 304 states, 301 states have (on average 2.681063122923588) internal successors, (807), 303 states have internal predecessors, (807), 0 states have call successors, (0), 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 17:33:55,080 INFO L276 IsEmpty]: Start isEmpty. Operand has 304 states, 301 states have (on average 2.681063122923588) internal successors, (807), 303 states have internal predecessors, (807), 0 states have call successors, (0), 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 17:33:55,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-03-15 17:33:55,085 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:33:55,085 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-03-15 17:33:55,085 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:33:55,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:33:55,089 INFO L85 PathProgramCache]: Analyzing trace with hash -774186158, now seen corresponding path program 1 times [2022-03-15 17:33:55,106 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:33:55,107 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59318693] [2022-03-15 17:33:55,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:33:55,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:33:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:33:55,321 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 17:33:55,321 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:33:55,321 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59318693] [2022-03-15 17:33:55,322 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59318693] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:33:55,322 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:33:55,322 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 17:33:55,323 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2005869597] [2022-03-15 17:33:55,324 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:33:55,326 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:33:55,334 INFO L252 McrAutomatonBuilder]: Finished intersection with 7 states and 6 transitions. [2022-03-15 17:33:55,334 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:33:55,336 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:33:55,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:33:55,337 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:33:55,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:33:55,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:33:55,358 INFO L87 Difference]: Start difference. First operand has 304 states, 301 states have (on average 2.681063122923588) internal successors, (807), 303 states have internal predecessors, (807), 0 states have call successors, (0), 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 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:33:55,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:33:55,481 INFO L93 Difference]: Finished difference Result 434 states and 1115 transitions. [2022-03-15 17:33:55,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:33:55,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-03-15 17:33:55,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:33:55,501 INFO L225 Difference]: With dead ends: 434 [2022-03-15 17:33:55,501 INFO L226 Difference]: Without dead ends: 416 [2022-03-15 17:33:55,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:33:55,505 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 19 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:33:55,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 1 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:33:55,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-03-15 17:33:55,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 392. [2022-03-15 17:33:55,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 389 states have (on average 2.67866323907455) internal successors, (1042), 391 states have internal predecessors, (1042), 0 states have call successors, (0), 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 17:33:55,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1042 transitions. [2022-03-15 17:33:55,554 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1042 transitions. Word has length 6 [2022-03-15 17:33:55,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:33:55,554 INFO L470 AbstractCegarLoop]: Abstraction has 392 states and 1042 transitions. [2022-03-15 17:33:55,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:33:55,554 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1042 transitions. [2022-03-15 17:33:55,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-03-15 17:33:55,555 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:33:55,555 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:33:55,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 17:33:55,556 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:33:55,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:33:55,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1395510492, now seen corresponding path program 1 times [2022-03-15 17:33:55,557 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:33:55,557 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249643971] [2022-03-15 17:33:55,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:33:55,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:33:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:33:55,617 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 17:33:55,617 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:33:55,617 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249643971] [2022-03-15 17:33:55,617 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249643971] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:33:55,617 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:33:55,617 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 17:33:55,618 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2123629081] [2022-03-15 17:33:55,618 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:33:55,619 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:33:55,620 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2022-03-15 17:33:55,620 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:33:55,620 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:33:55,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:33:55,621 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:33:55,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:33:55,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:33:55,622 INFO L87 Difference]: Start difference. First operand 392 states and 1042 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 17:33:55,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:33:55,674 INFO L93 Difference]: Finished difference Result 432 states and 1145 transitions. [2022-03-15 17:33:55,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:33:55,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-03-15 17:33:55,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:33:55,677 INFO L225 Difference]: With dead ends: 432 [2022-03-15 17:33:55,677 INFO L226 Difference]: Without dead ends: 432 [2022-03-15 17:33:55,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:33:55,679 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 18 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 17:33:55,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 2 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 17:33:55,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2022-03-15 17:33:55,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2022-03-15 17:33:55,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 429 states have (on average 2.668997668997669) internal successors, (1145), 431 states have internal predecessors, (1145), 0 states have call successors, (0), 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 17:33:55,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1145 transitions. [2022-03-15 17:33:55,697 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 1145 transitions. Word has length 10 [2022-03-15 17:33:55,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:33:55,697 INFO L470 AbstractCegarLoop]: Abstraction has 432 states and 1145 transitions. [2022-03-15 17:33:55,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 17:33:55,698 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 1145 transitions. [2022-03-15 17:33:55,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 17:33:55,699 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:33:55,699 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:33:55,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 17:33:55,699 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:33:55,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:33:55,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1627868975, now seen corresponding path program 1 times [2022-03-15 17:33:55,701 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:33:55,701 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332668748] [2022-03-15 17:33:55,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:33:55,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:33:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:33:55,772 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 17:33:55,772 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:33:55,772 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332668748] [2022-03-15 17:33:55,772 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332668748] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:33:55,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274051234] [2022-03-15 17:33:55,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:33:55,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:33:55,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:33:55,775 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 17:33:55,797 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 17:33:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:33:55,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 17:33:55,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:33:55,947 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 17:33:55,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:33:56,000 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 17:33:56,000 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274051234] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:33:56,001 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:33:56,001 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-03-15 17:33:56,001 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [444804643] [2022-03-15 17:33:56,001 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:33:56,003 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:33:56,004 INFO L252 McrAutomatonBuilder]: Finished intersection with 14 states and 13 transitions. [2022-03-15 17:33:56,005 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:33:56,005 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:33:56,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 17:33:56,005 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:33:56,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 17:33:56,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-15 17:33:56,006 INFO L87 Difference]: Start difference. First operand 432 states and 1145 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:33:56,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:33:56,152 INFO L93 Difference]: Finished difference Result 710 states and 1835 transitions. [2022-03-15 17:33:56,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:33:56,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 17:33:56,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:33:56,156 INFO L225 Difference]: With dead ends: 710 [2022-03-15 17:33:56,156 INFO L226 Difference]: Without dead ends: 710 [2022-03-15 17:33:56,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-03-15 17:33:56,158 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 53 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:33:56,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 2 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:33:56,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-03-15 17:33:56,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 544. [2022-03-15 17:33:56,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 541 states have (on average 2.7060998151571165) internal successors, (1464), 543 states have internal predecessors, (1464), 0 states have call successors, (0), 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 17:33:56,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1464 transitions. [2022-03-15 17:33:56,185 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1464 transitions. Word has length 13 [2022-03-15 17:33:56,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:33:56,185 INFO L470 AbstractCegarLoop]: Abstraction has 544 states and 1464 transitions. [2022-03-15 17:33:56,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:33:56,185 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1464 transitions. [2022-03-15 17:33:56,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 17:33:56,192 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:33:56,192 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:33:56,219 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 17:33:56,407 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 17:33:56,408 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:33:56,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:33:56,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1145049209, now seen corresponding path program 1 times [2022-03-15 17:33:56,411 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:33:56,411 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528125470] [2022-03-15 17:33:56,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:33:56,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:33:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:33:56,510 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 17:33:56,511 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:33:56,511 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528125470] [2022-03-15 17:33:56,512 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528125470] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:33:56,512 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:33:56,512 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:33:56,512 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [902546888] [2022-03-15 17:33:56,512 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:33:56,514 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:33:56,520 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 62 transitions. [2022-03-15 17:33:56,520 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:33:56,704 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:33:56,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:33:56,705 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:33:56,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:33:56,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:33:56,706 INFO L87 Difference]: Start difference. First operand 544 states and 1464 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 17:33:56,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:33:56,766 INFO L93 Difference]: Finished difference Result 250 states and 563 transitions. [2022-03-15 17:33:56,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:33:56,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 16 [2022-03-15 17:33:56,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:33:56,770 INFO L225 Difference]: With dead ends: 250 [2022-03-15 17:33:56,770 INFO L226 Difference]: Without dead ends: 250 [2022-03-15 17:33:56,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:33:56,773 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 18 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 17:33:56,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 1 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 17:33:56,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-03-15 17:33:56,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 238. [2022-03-15 17:33:56,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 236 states have (on average 2.25) internal successors, (531), 237 states have internal predecessors, (531), 0 states have call successors, (0), 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 17:33:56,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 531 transitions. [2022-03-15 17:33:56,784 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 531 transitions. Word has length 16 [2022-03-15 17:33:56,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:33:56,788 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 531 transitions. [2022-03-15 17:33:56,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 17:33:56,789 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 531 transitions. [2022-03-15 17:33:56,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 17:33:56,790 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:33:56,790 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:33:56,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 17:33:56,790 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:33:56,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:33:56,791 INFO L85 PathProgramCache]: Analyzing trace with hash -511957004, now seen corresponding path program 1 times [2022-03-15 17:33:56,792 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:33:56,792 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872881008] [2022-03-15 17:33:56,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:33:56,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:33:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:33:56,848 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 17:33:56,849 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:33:56,849 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872881008] [2022-03-15 17:33:56,849 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872881008] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:33:56,849 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:33:56,849 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:33:56,849 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1998063718] [2022-03-15 17:33:56,849 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:33:56,852 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:33:56,857 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 57 transitions. [2022-03-15 17:33:56,857 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:33:56,887 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:33:56,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:33:56,887 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:33:56,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:33:56,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:33:56,888 INFO L87 Difference]: Start difference. First operand 238 states and 531 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17:33:56,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:33:56,965 INFO L93 Difference]: Finished difference Result 296 states and 663 transitions. [2022-03-15 17:33:56,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:33:56,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-03-15 17:33:56,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:33:56,967 INFO L225 Difference]: With dead ends: 296 [2022-03-15 17:33:56,967 INFO L226 Difference]: Without dead ends: 290 [2022-03-15 17:33:56,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:33:56,968 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 18 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:33:56,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 1 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:33:56,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-03-15 17:33:56,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 248. [2022-03-15 17:33:56,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 246 states have (on average 2.231707317073171) internal successors, (549), 247 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:33:56,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 549 transitions. [2022-03-15 17:33:56,978 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 549 transitions. Word has length 17 [2022-03-15 17:33:56,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:33:56,979 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 549 transitions. [2022-03-15 17:33:56,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17:33:56,979 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 549 transitions. [2022-03-15 17:33:56,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 17:33:56,980 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:33:56,980 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-03-15 17:33:56,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 17:33:56,980 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:33:56,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:33:56,982 INFO L85 PathProgramCache]: Analyzing trace with hash 709262962, now seen corresponding path program 2 times [2022-03-15 17:33:56,983 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:33:56,983 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507036203] [2022-03-15 17:33:56,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:33:56,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:33:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:33:57,081 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:33:57,081 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:33:57,081 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507036203] [2022-03-15 17:33:57,081 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507036203] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:33:57,081 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566761607] [2022-03-15 17:33:57,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 17:33:57,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:33:57,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:33:57,083 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 17:33:57,111 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 17:33:57,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 17:33:57,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:33:57,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 17:33:57,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:33:57,288 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:33:57,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:33:57,358 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:33:57,358 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566761607] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:33:57,358 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:33:57,358 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-03-15 17:33:57,358 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1842388260] [2022-03-15 17:33:57,359 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:33:57,363 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:33:57,367 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 20 transitions. [2022-03-15 17:33:57,368 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:33:57,368 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:33:57,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 17:33:57,369 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:33:57,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 17:33:57,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2022-03-15 17:33:57,370 INFO L87 Difference]: Start difference. First operand 248 states and 549 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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 17:33:57,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:33:57,529 INFO L93 Difference]: Finished difference Result 404 states and 884 transitions. [2022-03-15 17:33:57,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 17:33:57,530 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-03-15 17:33:57,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:33:57,534 INFO L225 Difference]: With dead ends: 404 [2022-03-15 17:33:57,534 INFO L226 Difference]: Without dead ends: 404 [2022-03-15 17:33:57,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2022-03-15 17:33:57,535 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 100 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:33:57,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 2 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:33:57,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-03-15 17:33:57,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 304. [2022-03-15 17:33:57,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 302 states have (on average 2.23841059602649) internal successors, (676), 303 states have internal predecessors, (676), 0 states have call successors, (0), 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 17:33:57,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 676 transitions. [2022-03-15 17:33:57,546 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 676 transitions. Word has length 20 [2022-03-15 17:33:57,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:33:57,546 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 676 transitions. [2022-03-15 17:33:57,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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 17:33:57,547 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 676 transitions. [2022-03-15 17:33:57,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 17:33:57,547 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:33:57,548 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] [2022-03-15 17:33:57,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 17:33:57,763 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,SelfDestructingSolverStorable5 [2022-03-15 17:33:57,764 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:33:57,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:33:57,764 INFO L85 PathProgramCache]: Analyzing trace with hash 415194429, now seen corresponding path program 1 times [2022-03-15 17:33:57,765 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:33:57,765 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048349170] [2022-03-15 17:33:57,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:33:57,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:33:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:33:58,050 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 17:33:58,050 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:33:58,050 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048349170] [2022-03-15 17:33:58,050 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048349170] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:33:58,051 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:33:58,051 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-15 17:33:58,051 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2024496308] [2022-03-15 17:33:58,051 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:33:58,054 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:33:58,059 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 61 transitions. [2022-03-15 17:33:58,059 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:33:58,347 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:33:58,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 17:33:58,348 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:33:58,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 17:33:58,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-15 17:33:58,348 INFO L87 Difference]: Start difference. First operand 304 states and 676 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 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 17:33:58,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:33:58,824 INFO L93 Difference]: Finished difference Result 485 states and 1075 transitions. [2022-03-15 17:33:58,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 17:33:58,827 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-03-15 17:33:58,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:33:58,829 INFO L225 Difference]: With dead ends: 485 [2022-03-15 17:33:58,829 INFO L226 Difference]: Without dead ends: 420 [2022-03-15 17:33:58,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-03-15 17:33:58,830 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 97 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 17:33:58,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 8 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 17:33:58,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-03-15 17:33:58,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 350. [2022-03-15 17:33:58,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 348 states have (on average 2.25) internal successors, (783), 349 states have internal predecessors, (783), 0 states have call successors, (0), 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 17:33:58,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 783 transitions. [2022-03-15 17:33:58,839 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 783 transitions. Word has length 21 [2022-03-15 17:33:58,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:33:58,840 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 783 transitions. [2022-03-15 17:33:58,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 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 17:33:58,840 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 783 transitions. [2022-03-15 17:33:58,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 17:33:58,841 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:33:58,841 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] [2022-03-15 17:33:58,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 17:33:58,841 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:33:58,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:33:58,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1253157149, now seen corresponding path program 2 times [2022-03-15 17:33:58,842 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:33:58,843 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539102015] [2022-03-15 17:33:58,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:33:58,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:33:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:33:59,122 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 17:33:59,123 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:33:59,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539102015] [2022-03-15 17:33:59,123 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539102015] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:33:59,123 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:33:59,123 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-15 17:33:59,123 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1186231038] [2022-03-15 17:33:59,123 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:33:59,125 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:33:59,129 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 39 transitions. [2022-03-15 17:33:59,129 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:33:59,297 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:33:59,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 17:33:59,298 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:33:59,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 17:33:59,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-03-15 17:33:59,299 INFO L87 Difference]: Start difference. First operand 350 states and 783 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 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 17:33:59,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:33:59,773 INFO L93 Difference]: Finished difference Result 506 states and 1124 transitions. [2022-03-15 17:33:59,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 17:33:59,774 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-03-15 17:33:59,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:33:59,776 INFO L225 Difference]: With dead ends: 506 [2022-03-15 17:33:59,776 INFO L226 Difference]: Without dead ends: 440 [2022-03-15 17:33:59,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-03-15 17:33:59,776 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 120 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 17:33:59,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 9 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 17:33:59,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-03-15 17:33:59,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 332. [2022-03-15 17:33:59,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 330 states have (on average 2.2303030303030305) internal successors, (736), 331 states have internal predecessors, (736), 0 states have call successors, (0), 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 17:33:59,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 736 transitions. [2022-03-15 17:33:59,785 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 736 transitions. Word has length 21 [2022-03-15 17:33:59,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:33:59,785 INFO L470 AbstractCegarLoop]: Abstraction has 332 states and 736 transitions. [2022-03-15 17:33:59,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 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 17:33:59,785 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 736 transitions. [2022-03-15 17:33:59,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 17:33:59,786 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:33:59,786 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] [2022-03-15 17:33:59,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 17:33:59,787 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:33:59,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:33:59,787 INFO L85 PathProgramCache]: Analyzing trace with hash -447250857, now seen corresponding path program 1 times [2022-03-15 17:33:59,788 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:33:59,788 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656713076] [2022-03-15 17:33:59,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:33:59,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:33:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:33:59,838 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 17:33:59,839 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:33:59,839 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656713076] [2022-03-15 17:33:59,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656713076] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:33:59,839 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464913132] [2022-03-15 17:33:59,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:33:59,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:33:59,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:33:59,844 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 17:33:59,867 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 17:33:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:33:59,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 17:33:59,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:34:00,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 17:34:00,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 17:34:00,001 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464913132] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:34:00,001 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 17:34:00,001 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-03-15 17:34:00,001 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [775351752] [2022-03-15 17:34:00,001 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:34:00,004 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:34:00,012 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 64 transitions. [2022-03-15 17:34:00,012 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:34:00,171 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [10325#(or (= 400 ~top~0) (<= ~top~0 0))] [2022-03-15 17:34:00,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 17:34:00,171 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:34:00,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 17:34:00,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-03-15 17:34:00,172 INFO L87 Difference]: Start difference. First operand 332 states and 736 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 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 17:34:00,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:34:00,329 INFO L93 Difference]: Finished difference Result 556 states and 1214 transitions. [2022-03-15 17:34:00,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 17:34:00,329 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 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 24 [2022-03-15 17:34:00,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:34:00,331 INFO L225 Difference]: With dead ends: 556 [2022-03-15 17:34:00,331 INFO L226 Difference]: Without dead ends: 544 [2022-03-15 17:34:00,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-03-15 17:34:00,332 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 59 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:34:00,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 2 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:34:00,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2022-03-15 17:34:00,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 404. [2022-03-15 17:34:00,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 402 states have (on average 2.228855721393035) internal successors, (896), 403 states have internal predecessors, (896), 0 states have call successors, (0), 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 17:34:00,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 896 transitions. [2022-03-15 17:34:00,343 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 896 transitions. Word has length 24 [2022-03-15 17:34:00,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:34:00,343 INFO L470 AbstractCegarLoop]: Abstraction has 404 states and 896 transitions. [2022-03-15 17:34:00,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 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 17:34:00,344 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 896 transitions. [2022-03-15 17:34:00,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 17:34:00,345 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:34:00,345 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2022-03-15 17:34:00,371 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 17:34:00,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:34:00,568 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:34:00,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:34:00,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1675970993, now seen corresponding path program 3 times [2022-03-15 17:34:00,569 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:34:00,569 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564748873] [2022-03-15 17:34:00,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:34:00,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:34:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:34:00,656 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:34:00,656 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:34:00,656 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564748873] [2022-03-15 17:34:00,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564748873] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:34:00,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098454670] [2022-03-15 17:34:00,657 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 17:34:00,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:34:00,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:34:00,660 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 17:34:00,693 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 17:34:00,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 17:34:00,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:34:00,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 17:34:00,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:34:00,859 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:34:00,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:34:00,956 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:34:00,956 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098454670] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:34:00,956 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:34:00,956 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 19 [2022-03-15 17:34:00,957 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [370088594] [2022-03-15 17:34:00,957 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:34:00,960 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:34:00,965 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 27 transitions. [2022-03-15 17:34:00,965 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:34:00,965 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:34:00,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 17:34:00,967 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:34:00,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 17:34:00,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2022-03-15 17:34:00,968 INFO L87 Difference]: Start difference. First operand 404 states and 896 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 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 17:34:01,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:34:01,167 INFO L93 Difference]: Finished difference Result 630 states and 1370 transitions. [2022-03-15 17:34:01,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 17:34:01,167 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 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 17:34:01,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:34:01,170 INFO L225 Difference]: With dead ends: 630 [2022-03-15 17:34:01,170 INFO L226 Difference]: Without dead ends: 630 [2022-03-15 17:34:01,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2022-03-15 17:34:01,171 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 129 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 17:34:01,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 3 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 17:34:01,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2022-03-15 17:34:01,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 476. [2022-03-15 17:34:01,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 474 states have (on average 2.2552742616033754) internal successors, (1069), 475 states have internal predecessors, (1069), 0 states have call successors, (0), 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 17:34:01,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1069 transitions. [2022-03-15 17:34:01,182 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 1069 transitions. Word has length 27 [2022-03-15 17:34:01,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:34:01,183 INFO L470 AbstractCegarLoop]: Abstraction has 476 states and 1069 transitions. [2022-03-15 17:34:01,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 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 17:34:01,183 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 1069 transitions. [2022-03-15 17:34:01,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 17:34:01,184 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:34:01,184 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:34:01,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 17:34:01,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:34:01,395 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:34:01,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:34:01,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1873591140, now seen corresponding path program 3 times [2022-03-15 17:34:01,396 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:34:01,397 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608699902] [2022-03-15 17:34:01,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:34:01,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:34:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:34:01,650 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 17:34:01,651 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:34:01,651 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608699902] [2022-03-15 17:34:01,651 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608699902] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:34:01,651 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:34:01,651 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-15 17:34:01,651 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [220543069] [2022-03-15 17:34:01,651 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:34:01,655 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:34:01,665 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 96 transitions. [2022-03-15 17:34:01,665 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:34:03,410 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [13483#(or (= |~#arr~0.offset| 0) (< (+ 2147483649 ~top~0) 0) (< (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648) 0) (= ~top~0 399) (< 2147483647 |t1Thread1of1ForFork0_push_#t~ret35#1|) (< 2147483646 ~top~0)), 13477#(and (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (= |~#arr~0.offset| 0) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648)))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= (* ~top~0 4) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)))) (and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (* ~top~0 4) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))))))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (and (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 399) (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (* ~top~0 4) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)))))) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= |t1Thread1of1ForFork0_push_~x#1| 399) (= (* ~top~0 4) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)))) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))))), 13482#(or (= |~#arr~0.offset| 0) (< (+ 2147483649 ~top~0) 0) (= 400 (+ ~top~0 1)) (< 2147483646 ~top~0)), 13479#(and (or (not (<= 0 (+ ~top~0 2147483648))) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (* ~top~0 4)) (not (<= ~top~0 2147483647)) (= 400 ~top~0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)))) (or (not (<= 0 (+ ~top~0 2147483648))) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647)) (= 400 ~top~0)) (or (not (<= 0 (+ ~top~0 2147483648))) (<= 0 |t1Thread1of1ForFork0_push_#in~x#1|) (not (<= ~top~0 2147483647)) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (= 400 ~top~0) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (* ~top~0 4)))) (or (not (<= 0 (+ ~top~0 2147483648))) (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 399) (not (<= ~top~0 2147483647)) (= 400 ~top~0) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (= 400 ~top~0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (<= |t1Thread1of1ForFork0_push_#in~x#1| 399) (= 400 ~top~0) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (* ~top~0 4)))) (or (not (<= 0 (+ ~top~0 2147483648))) (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 399) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (* ~top~0 4)) (not (<= ~top~0 2147483647)) (= 400 ~top~0))), 13478#(and (or (not (<= 0 (+ ~top~0 2147483648))) (= (* ~top~0 4) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)) (not (<= ~top~0 2147483647)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (not (<= ~top~0 2147483647)) (not (= (* ~top~0 4) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)))) (or (not (<= 0 (+ ~top~0 2147483648))) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647))) (or (not (<= 0 (+ ~top~0 2147483648))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 399) (not (<= ~top~0 2147483647))) (or (not (<= 0 (+ ~top~0 2147483648))) (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 399) (= (* ~top~0 4) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)) (not (<= ~top~0 2147483647))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (not (<= ~top~0 2147483647)) (<= |t1Thread1of1ForFork0_push_~x#1| 399) (not (= (* ~top~0 4) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)))) (or (not (<= 0 (+ ~top~0 2147483648))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (<= ~top~0 2147483647)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))))), 13480#(or (< 2147483647 ~top~0) (= |~#arr~0.offset| 0) (< (+ ~top~0 2147483648) 0) (= 400 ~top~0)), 13481#(or (= |~#arr~0.offset| 0) (< 2147483646 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (< (+ 2147483649 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) 0) (= 400 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1))), 13484#(or (= |~#arr~0.offset| 0) (< (+ ~top~0 2147483648) 0) (= ~top~0 399) (< 2147483646 ~top~0)), 13485#(or (= |~#arr~0.offset| 0) (< (+ ~top~0 2147483648) 0) (= 400 ~top~0) (= ~top~0 399) (< 2147483646 ~top~0))] [2022-03-15 17:34:03,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 17:34:03,411 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:34:03,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 17:34:03,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2022-03-15 17:34:03,412 INFO L87 Difference]: Start difference. First operand 476 states and 1069 transitions. Second operand has 24 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 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 17:34:04,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:34:04,986 INFO L93 Difference]: Finished difference Result 1012 states and 2260 transitions. [2022-03-15 17:34:04,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 17:34:04,986 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 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 17:34:04,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:34:04,990 INFO L225 Difference]: With dead ends: 1012 [2022-03-15 17:34:04,990 INFO L226 Difference]: Without dead ends: 975 [2022-03-15 17:34:04,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=538, Invalid=1718, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 17:34:04,991 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 367 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 17:34:04,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [367 Valid, 0 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1276 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 17:34:04,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2022-03-15 17:34:05,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 629. [2022-03-15 17:34:05,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 627 states have (on average 2.325358851674641) internal successors, (1458), 628 states have internal predecessors, (1458), 0 states have call successors, (0), 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 17:34:05,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1458 transitions. [2022-03-15 17:34:05,007 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1458 transitions. Word has length 28 [2022-03-15 17:34:05,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:34:05,007 INFO L470 AbstractCegarLoop]: Abstraction has 629 states and 1458 transitions. [2022-03-15 17:34:05,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 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 17:34:05,007 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1458 transitions. [2022-03-15 17:34:05,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 17:34:05,008 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:34:05,009 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:34:05,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-15 17:34:05,009 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:34:05,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:34:05,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1156335038, now seen corresponding path program 4 times [2022-03-15 17:34:05,010 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:34:05,010 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515650375] [2022-03-15 17:34:05,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:34:05,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:34:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:34:06,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:34:06,039 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:34:06,039 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515650375] [2022-03-15 17:34:06,039 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515650375] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:34:06,039 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875120027] [2022-03-15 17:34:06,039 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 17:34:06,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:34:06,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:34:06,041 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 17:34:06,068 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 17:34:06,154 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 17:34:06,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:34:06,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 68 conjunts are in the unsatisfiable core [2022-03-15 17:34:06,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:34:06,196 INFO L353 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-03-15 17:34:06,197 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 29 treesize of output 34 [2022-03-15 17:34:06,737 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 19 treesize of output 15 [2022-03-15 17:34:06,841 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 76 treesize of output 70 [2022-03-15 17:34:07,567 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 92 treesize of output 56 [2022-03-15 17:34:24,564 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:34:24,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:34:25,087 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_412 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_412) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-03-15 17:34:25,105 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:34:25,105 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 29 treesize of output 30 [2022-03-15 17:34:25,114 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:34:25,114 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 49 treesize of output 52 [2022-03-15 17:34:25,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 28 treesize of output 22 [2022-03-15 17:34:25,414 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 17:34:25,414 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875120027] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:34:25,414 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:34:25,414 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 14] total 50 [2022-03-15 17:34:25,414 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [498839145] [2022-03-15 17:34:25,414 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:34:25,418 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:34:25,424 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 46 transitions. [2022-03-15 17:34:25,424 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:34:25,987 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:34:25,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 17:34:25,987 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:34:25,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 17:34:25,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2330, Unknown=7, NotChecked=98, Total=2652 [2022-03-15 17:34:25,988 INFO L87 Difference]: Start difference. First operand 629 states and 1458 transitions. Second operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 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 17:34:32,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:34:32,902 INFO L93 Difference]: Finished difference Result 908 states and 2028 transitions. [2022-03-15 17:34:32,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 17:34:32,903 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 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 17:34:32,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:34:32,906 INFO L225 Difference]: With dead ends: 908 [2022-03-15 17:34:32,906 INFO L226 Difference]: Without dead ends: 908 [2022-03-15 17:34:32,907 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1262 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=540, Invalid=4426, Unknown=8, NotChecked=138, Total=5112 [2022-03-15 17:34:32,908 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 264 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 17:34:32,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 0 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 17:34:32,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2022-03-15 17:34:32,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 610. [2022-03-15 17:34:32,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 608 states have (on average 2.3092105263157894) internal successors, (1404), 609 states have internal predecessors, (1404), 0 states have call successors, (0), 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 17:34:32,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 1404 transitions. [2022-03-15 17:34:32,922 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 1404 transitions. Word has length 28 [2022-03-15 17:34:32,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:34:32,922 INFO L470 AbstractCegarLoop]: Abstraction has 610 states and 1404 transitions. [2022-03-15 17:34:32,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 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 17:34:32,923 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 1404 transitions. [2022-03-15 17:34:32,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 17:34:32,924 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:34:32,924 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:34:32,946 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 17:34:33,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-15 17:34:33,139 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:34:33,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:34:33,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1239999792, now seen corresponding path program 2 times [2022-03-15 17:34:33,141 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:34:33,141 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317398347] [2022-03-15 17:34:33,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:34:33,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:34:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:34:33,278 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 17:34:33,279 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:34:33,279 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317398347] [2022-03-15 17:34:33,279 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317398347] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:34:33,279 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361711155] [2022-03-15 17:34:33,279 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 17:34:33,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:34:33,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:34:33,284 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 17:34:33,285 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 17:34:33,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 17:34:33,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:34:33,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 17:34:33,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:34:33,459 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 17:34:33,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:34:33,554 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 17:34:33,555 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361711155] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:34:33,555 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:34:33,555 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2022-03-15 17:34:33,555 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [461885219] [2022-03-15 17:34:33,555 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:34:33,558 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:34:33,569 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 99 transitions. [2022-03-15 17:34:33,570 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:34:34,131 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [18383#(or (< (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648) 0) (< 2147483647 |t1Thread1of1ForFork0_push_#t~ret35#1|) (<= ~top~0 1)), 18387#(or (= 400 (+ ~top~0 1)) (<= ~top~0 0) (< 2147483646 ~top~0)), 18389#(or (= 400 ~top~0) (= ~top~0 399) (<= ~top~0 0) (< 2147483646 ~top~0)), 18384#(or (< 2147483647 ~top~0) (<= ~top~0 1)), 18385#(or (< 2147483647 ~top~0) (= 400 ~top~0) (<= ~top~0 1)), 18388#(or (< (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648) 0) (= ~top~0 399) (< 2147483647 |t1Thread1of1ForFork0_push_#t~ret35#1|) (<= ~top~0 0) (< 2147483646 ~top~0)), 18386#(or (< 2147483646 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (<= |t1Thread1of1ForFork0_inc_top_#t~post31#1| 0) (= 400 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1)))] [2022-03-15 17:34:34,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 17:34:34,131 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:34:34,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 17:34:34,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2022-03-15 17:34:34,132 INFO L87 Difference]: Start difference. First operand 610 states and 1404 transitions. Second operand has 16 states, 16 states have (on average 3.75) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 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 17:34:34,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:34:34,609 INFO L93 Difference]: Finished difference Result 1031 states and 2275 transitions. [2022-03-15 17:34:34,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 17:34:34,609 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 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 17:34:34,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:34:34,613 INFO L225 Difference]: With dead ends: 1031 [2022-03-15 17:34:34,613 INFO L226 Difference]: Without dead ends: 1031 [2022-03-15 17:34:34,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 77 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=254, Invalid=868, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 17:34:34,614 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 199 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 17:34:34,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 4 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 17:34:34,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2022-03-15 17:34:34,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 702. [2022-03-15 17:34:34,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 700 states have (on average 2.357142857142857) internal successors, (1650), 701 states have internal predecessors, (1650), 0 states have call successors, (0), 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 17:34:34,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1650 transitions. [2022-03-15 17:34:34,629 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1650 transitions. Word has length 31 [2022-03-15 17:34:34,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:34:34,630 INFO L470 AbstractCegarLoop]: Abstraction has 702 states and 1650 transitions. [2022-03-15 17:34:34,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 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 17:34:34,630 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1650 transitions. [2022-03-15 17:34:34,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 17:34:34,631 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:34:34,631 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2022-03-15 17:34:34,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 17:34:34,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:34:34,848 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:34:34,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:34:34,848 INFO L85 PathProgramCache]: Analyzing trace with hash -611964526, now seen corresponding path program 4 times [2022-03-15 17:34:34,849 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:34:34,849 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433415369] [2022-03-15 17:34:34,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:34:34,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:34:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:34:34,984 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:34:34,984 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:34:34,984 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433415369] [2022-03-15 17:34:34,984 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433415369] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:34:34,984 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498763268] [2022-03-15 17:34:34,985 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 17:34:34,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:34:34,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:34:34,986 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 17:34:35,016 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 17:34:35,107 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 17:34:35,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:34:35,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 17:34:35,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:34:35,176 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:34:35,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:34:35,308 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:34:35,308 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498763268] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:34:35,308 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:34:35,308 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 24 [2022-03-15 17:34:35,308 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1634761071] [2022-03-15 17:34:35,308 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:34:35,312 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:34:35,338 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 34 transitions. [2022-03-15 17:34:35,338 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:34:35,338 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:34:35,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 17:34:35,339 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:34:35,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 17:34:35,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2022-03-15 17:34:35,339 INFO L87 Difference]: Start difference. First operand 702 states and 1650 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 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 17:34:35,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:34:35,572 INFO L93 Difference]: Finished difference Result 1078 states and 2443 transitions. [2022-03-15 17:34:35,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 17:34:35,572 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 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 17:34:35,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:34:35,576 INFO L225 Difference]: With dead ends: 1078 [2022-03-15 17:34:35,576 INFO L226 Difference]: Without dead ends: 1078 [2022-03-15 17:34:35,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=257, Invalid=613, Unknown=0, NotChecked=0, Total=870 [2022-03-15 17:34:35,577 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 182 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 17:34:35,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 3 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 17:34:35,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2022-03-15 17:34:35,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 804. [2022-03-15 17:34:35,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 802 states have (on average 2.3728179551122195) internal successors, (1903), 803 states have internal predecessors, (1903), 0 states have call successors, (0), 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 17:34:35,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1903 transitions. [2022-03-15 17:34:35,594 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1903 transitions. Word has length 34 [2022-03-15 17:34:35,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:34:35,594 INFO L470 AbstractCegarLoop]: Abstraction has 804 states and 1903 transitions. [2022-03-15 17:34:35,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 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 17:34:35,594 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1903 transitions. [2022-03-15 17:34:35,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 17:34:35,595 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:34:35,595 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:34:35,620 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 17:34:35,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:34:35,812 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:34:35,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:34:35,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1050189315, now seen corresponding path program 5 times [2022-03-15 17:34:35,813 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:34:35,813 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550266103] [2022-03-15 17:34:35,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:34:35,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:34:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:34:37,831 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:34:37,831 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:34:37,831 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550266103] [2022-03-15 17:34:37,831 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550266103] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:34:37,832 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177329993] [2022-03-15 17:34:37,832 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 17:34:37,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:34:37,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:34:37,834 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 17:34:37,834 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 17:34:37,936 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 17:34:37,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:34:37,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 17:34:37,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:34:37,961 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-15 17:34:37,961 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 20 treesize of output 22 [2022-03-15 17:34:38,303 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 19 treesize of output 15 [2022-03-15 17:34:38,409 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 76 treesize of output 70 [2022-03-15 17:34:39,076 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 128 treesize of output 56 [2022-03-15 17:34:57,668 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 17:34:57,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:34:58,223 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_625 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_625) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) is different from false [2022-03-15 17:34:58,231 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:34:58,232 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 29 treesize of output 30 [2022-03-15 17:34:58,241 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:34:58,241 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 49 treesize of output 52 [2022-03-15 17:34:58,245 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 28 treesize of output 22 [2022-03-15 17:34:58,586 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 17:34:58,587 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177329993] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:34:58,587 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:34:58,587 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 14, 14] total 54 [2022-03-15 17:34:58,587 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [891775347] [2022-03-15 17:34:58,587 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:34:58,592 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:34:58,602 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 53 transitions. [2022-03-15 17:34:58,602 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:34:59,557 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:34:59,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 17:34:59,557 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:34:59,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 17:34:59,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=2651, Unknown=8, NotChecked=106, Total=3080 [2022-03-15 17:34:59,558 INFO L87 Difference]: Start difference. First operand 804 states and 1903 transitions. Second operand has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:35:19,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:35:19,123 INFO L93 Difference]: Finished difference Result 1234 states and 2799 transitions. [2022-03-15 17:35:19,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 17:35:19,124 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-03-15 17:35:19,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:35:19,127 INFO L225 Difference]: With dead ends: 1234 [2022-03-15 17:35:19,127 INFO L226 Difference]: Without dead ends: 1234 [2022-03-15 17:35:19,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 83 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2134 ImplicationChecksByTransitivity, 37.4s TimeCoverageRelationStatistics Valid=970, Invalid=5997, Unknown=9, NotChecked=164, Total=7140 [2022-03-15 17:35:19,129 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 398 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-03-15 17:35:19,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [398 Valid, 0 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-03-15 17:35:19,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2022-03-15 17:35:19,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 784. [2022-03-15 17:35:19,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 782 states have (on average 2.363171355498721) internal successors, (1848), 783 states have internal predecessors, (1848), 0 states have call successors, (0), 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 17:35:19,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1848 transitions. [2022-03-15 17:35:19,152 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1848 transitions. Word has length 35 [2022-03-15 17:35:19,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:35:19,152 INFO L470 AbstractCegarLoop]: Abstraction has 784 states and 1848 transitions. [2022-03-15 17:35:19,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:35:19,152 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1848 transitions. [2022-03-15 17:35:19,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 17:35:19,154 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:35:19,154 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:35:19,180 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 17:35:19,367 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,SelfDestructingSolverStorable14 [2022-03-15 17:35:19,367 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:35:19,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:35:19,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1198232037, now seen corresponding path program 1 times [2022-03-15 17:35:19,369 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:35:19,370 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032912573] [2022-03-15 17:35:19,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:35:19,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:35:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:35:20,200 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:35:20,201 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:35:20,201 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032912573] [2022-03-15 17:35:20,201 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032912573] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:35:20,201 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242992367] [2022-03-15 17:35:20,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:35:20,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:35:20,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:35:20,202 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 17:35:20,203 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 17:35:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:35:20,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 71 conjunts are in the unsatisfiable core [2022-03-15 17:35:20,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:35:20,596 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 19 treesize of output 15 [2022-03-15 17:35:21,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:35:21,057 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 90 treesize of output 53 [2022-03-15 17:35:21,821 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 128 treesize of output 56 [2022-03-15 17:35:31,822 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:35:31,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:35:33,429 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_692 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_151| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_151| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_151|)) v_ArrVal_692)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)))) is different from false [2022-03-15 17:36:04,204 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 54 treesize of output 46 [2022-03-15 17:36:04,405 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-15 17:36:04,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242992367] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:36:04,405 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:36:04,405 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 19, 19] total 63 [2022-03-15 17:36:04,405 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1585116799] [2022-03-15 17:36:04,405 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:36:04,410 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:36:04,424 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 104 transitions. [2022-03-15 17:36:04,424 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:36:08,651 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [27166#(and (or (< (* ~top~0 4) 0) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= ~top~0 399) (not (= |t1Thread1of1ForFork0_push_~stack#1.offset| 0)) (< 2147483646 ~top~0)) (or (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 2147483647) (< (* ~top~0 4) 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= ~top~0 399) (< 2147483646 ~top~0)) (or (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 2147483647) (< (* ~top~0 4) 0) (= ~top~0 399) (= |t1Thread1of1ForFork0_push_~stack#1.offset| 0) (< 2147483646 ~top~0)) (or (= |~#arr~0.offset| 0) (< (+ ~top~0 2147483648) 0) (= ~top~0 399) (< 2147483646 ~top~0)) (or (= ~top~0 399) (<= (* ~top~0 4) 0) (< 2147483646 ~top~0)) (or (< (* ~top~0 4) 0) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= ~top~0 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (< 2147483646 ~top~0)) (or (< (* ~top~0 4) 0) (= ~top~0 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (= |t1Thread1of1ForFork0_push_~stack#1.offset| 0) (< 2147483646 ~top~0)) (or (< (* ~top~0 4) 0) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647) (= ~top~0 399) (not (= |t1Thread1of1ForFork0_push_~stack#1.offset| 0)) (< 2147483646 ~top~0))), 27161#(and (or (not (<= ~top~0 2147483647)) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ (* ~top~0 4) (- 4))) (< (* ~top~0 4) 4) (= 400 ~top~0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647)) (or (<= |t1Thread1of1ForFork0_push_#in~x#1| 2147483647) (not (<= ~top~0 2147483647)) (< (* ~top~0 4) 4) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (= 400 ~top~0) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ (* ~top~0 4) (- 4))))) (or (not (<= 0 (+ ~top~0 2147483648))) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647)) (= 400 ~top~0)) (or (<= 0 |t1Thread1of1ForFork0_push_#in~x#1|) (not (<= ~top~0 2147483647)) (< (* ~top~0 4) 4) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (= 400 ~top~0) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ (* ~top~0 4) (- 4))))) (or (not (<= ~top~0 2147483647)) (< (* ~top~0 4) 4) (= 400 ~top~0) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647)) (or (not (<= ~top~0 2147483647)) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ (* ~top~0 4) (- 4))) (< (* ~top~0 4) 4) (= 400 ~top~0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (or (not (<= ~top~0 2147483647)) (= 400 ~top~0) (<= (* ~top~0 4) 4)) (or (not (<= ~top~0 2147483647)) (< (* ~top~0 4) 4) (= 400 ~top~0) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4)))))), 27163#(and (or (= |~#arr~0.offset| 0) (< 2147483646 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (< (+ 2147483649 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) 0) (= 400 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1))) (or (<= (select (select |#memory_int| |~#arr~0.base|) (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4)) 2147483647) (< 2147483646 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (< (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4) 0) (= 400 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1))) (or (< 2147483646 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (<= (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4) 0) (= 400 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1))) (or (< 2147483646 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4))) (< (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4) 0) (= 400 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1)))), 27160#(and (or (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (<= ~top~0 2147483647)) (< (* ~top~0 4) 4) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647)) (or (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (not (<= ~top~0 2147483647)) (< (* ~top~0 4) 4) (not (= (+ (* ~top~0 4) (- 4)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647)) (or (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (not (<= ~top~0 2147483647)) (< (* ~top~0 4) 4) (not (= (+ (* ~top~0 4) (- 4)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)))) (or (not (<= ~top~0 2147483647)) (< (* ~top~0 4) 4) (= (+ (* ~top~0 4) (- 4)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647)) (or (not (<= 0 (+ ~top~0 2147483648))) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647))) (or (not (<= ~top~0 2147483647)) (< (* ~top~0 4) 4) (= (+ (* ~top~0 4) (- 4)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (or (not (<= ~top~0 2147483647)) (<= (* ~top~0 4) 4)) (or (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (<= ~top~0 2147483647)) (< (* ~top~0 4) 4) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4)))))), 27165#(and (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (= 400 (+ ~top~0 1)) (<= (* ~top~0 4) 0) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (< 2147483646 ~top~0)) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (< (* ~top~0 4) 0) (= 400 (+ ~top~0 1)) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= (* ~top~0 4) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)))) (and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (* ~top~0 4) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)))))) (< 2147483646 ~top~0)) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (= |~#arr~0.offset| 0) (< (+ 2147483649 ~top~0) 0) (= 400 (+ ~top~0 1)) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (< 2147483646 ~top~0)) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (< (* ~top~0 4) 0) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (* ~top~0 4) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647)) (= 400 (+ ~top~0 1)) (and (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 2147483647) (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (* ~top~0 4) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)))))) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (< 2147483646 ~top~0))), 27168#(and (or (= 400 ~top~0) (= ~top~0 399) (<= (* ~top~0 4) 0) (< 2147483646 ~top~0)) (or (= |~#arr~0.offset| 0) (< (+ ~top~0 2147483648) 0) (= 400 ~top~0) (= ~top~0 399) (< 2147483646 ~top~0))), 27167#(and (or (= 400 ~top~0) (= ~top~0 399) (<= (* ~top~0 4) 0) (< 2147483646 ~top~0)) (or (<= |t1Thread1of1ForFork0_push_#in~x#1| 2147483647) (< (* ~top~0 4) 0) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (= 400 ~top~0) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.offset| 0)) (= ~top~0 399) (< 2147483646 ~top~0)) (or (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 2147483647) (< (* ~top~0 4) 0) (= 400 ~top~0) (= ~top~0 399) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (< 2147483646 ~top~0)) (or (< (* ~top~0 4) 0) (<= 0 |t1Thread1of1ForFork0_push_#in~x#1|) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (= 400 ~top~0) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.offset| 0)) (= ~top~0 399) (< 2147483646 ~top~0)) (or (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 2147483647) (< (* ~top~0 4) 0) (= |t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (= 400 ~top~0) (= ~top~0 399) (< 2147483646 ~top~0)) (or (= |~#arr~0.offset| 0) (< (+ ~top~0 2147483648) 0) (= 400 ~top~0) (= ~top~0 399) (< 2147483646 ~top~0)) (or (< (* ~top~0 4) 0) (= |t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (= 400 ~top~0) (= ~top~0 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (< 2147483646 ~top~0)) (or (< (* ~top~0 4) 0) (= 400 ~top~0) (= ~top~0 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (< 2147483646 ~top~0))), 27162#(and (or (< 2147483647 ~top~0) (< (* ~top~0 4) 4) (= 400 ~top~0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (or (< 2147483647 ~top~0) (< (* ~top~0 4) 4) (= 400 ~top~0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647)) (or (< 2147483647 ~top~0) (= 400 ~top~0) (<= (* ~top~0 4) 4)) (or (< 2147483647 ~top~0) (= |~#arr~0.offset| 0) (< (+ ~top~0 2147483648) 0) (= 400 ~top~0))), 27159#(and (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (= |~#arr~0.offset| 0) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648)))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (< (* ~top~0 4) 4) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (+ (* ~top~0 4) (- 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))) (<= 0 |t1Thread1of1ForFork0_push_~x#1|)) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (and (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (+ (* ~top~0 4) (- 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4)))))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (and (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (+ (* ~top~0 4) (- 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))))) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647)) (< (* ~top~0 4) 4) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (+ (* ~top~0 4) (- 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (<= (* ~top~0 4) 4))), 27164#(and (or (= |~#arr~0.offset| 0) (< (+ 2147483649 ~top~0) 0) (= 400 (+ ~top~0 1)) (< 2147483646 ~top~0)) (or (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 2147483647) (< (* ~top~0 4) 0) (= 400 (+ ~top~0 1)) (< 2147483646 ~top~0)) (or (< (* ~top~0 4) 0) (= 400 (+ ~top~0 1)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (< 2147483646 ~top~0)) (or (= 400 (+ ~top~0 1)) (<= (* ~top~0 4) 0) (< 2147483646 ~top~0)))] [2022-03-15 17:36:08,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 17:36:08,652 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:36:08,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 17:36:08,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=4960, Unknown=7, NotChecked=142, Total=5402 [2022-03-15 17:36:08,654 INFO L87 Difference]: Start difference. First operand 784 states and 1848 transitions. Second operand has 37 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 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 17:36:26,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:36:26,803 INFO L93 Difference]: Finished difference Result 1640 states and 3629 transitions. [2022-03-15 17:36:26,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-03-15 17:36:26,803 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 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 17:36:26,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:36:26,808 INFO L225 Difference]: With dead ends: 1640 [2022-03-15 17:36:26,808 INFO L226 Difference]: Without dead ends: 1547 [2022-03-15 17:36:26,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 148 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6457 ImplicationChecksByTransitivity, 60.2s TimeCoverageRelationStatistics Valid=2229, Invalid=19819, Unknown=8, NotChecked=294, Total=22350 [2022-03-15 17:36:26,813 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 687 mSDsluCounter, 1633 mSDsCounter, 0 mSdLazyCounter, 3869 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 4054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 3869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-15 17:36:26,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [687 Valid, 5 Invalid, 4054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 3869 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-03-15 17:36:26,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2022-03-15 17:36:26,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 989. [2022-03-15 17:36:26,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 987 states have (on average 2.375886524822695) internal successors, (2345), 988 states have internal predecessors, (2345), 0 states have call successors, (0), 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 17:36:26,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 2345 transitions. [2022-03-15 17:36:26,834 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 2345 transitions. Word has length 36 [2022-03-15 17:36:26,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:36:26,834 INFO L470 AbstractCegarLoop]: Abstraction has 989 states and 2345 transitions. [2022-03-15 17:36:26,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 states have internal predecessors, (75), 0 states have call successors, (0), 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 17:36:26,835 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 2345 transitions. [2022-03-15 17:36:26,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 17:36:26,836 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:36:26,836 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:36:26,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-03-15 17:36:27,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 17:36:27,052 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:36:27,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:36:27,052 INFO L85 PathProgramCache]: Analyzing trace with hash -824440315, now seen corresponding path program 2 times [2022-03-15 17:36:27,053 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:36:27,053 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243341386] [2022-03-15 17:36:27,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:36:27,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:36:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:36:28,263 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:36:28,263 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:36:28,263 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243341386] [2022-03-15 17:36:28,264 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243341386] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:36:28,264 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842921703] [2022-03-15 17:36:28,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 17:36:28,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:36:28,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:36:28,265 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 17:36:28,267 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 17:36:28,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 17:36:28,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:36:28,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 86 conjunts are in the unsatisfiable core [2022-03-15 17:36:28,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:36:28,431 INFO L353 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-03-15 17:36:28,431 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 29 treesize of output 34 [2022-03-15 17:36:28,812 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 19 treesize of output 15 [2022-03-15 17:36:28,909 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 76 treesize of output 70 [2022-03-15 17:36:29,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:36:29,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 65 treesize of output 48 [2022-03-15 17:36:30,566 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 92 treesize of output 56 [2022-03-15 17:36:40,618 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:36:40,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:37:33,804 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_761 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_761) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-03-15 17:37:33,811 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:37:33,811 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 29 treesize of output 30 [2022-03-15 17:37:33,820 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:37:33,820 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 49 treesize of output 52 [2022-03-15 17:37:33,824 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 28 treesize of output 22 [2022-03-15 17:37:34,158 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:37:34,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842921703] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:37:34,158 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:37:34,158 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 20] total 62 [2022-03-15 17:37:34,159 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [910198337] [2022-03-15 17:37:34,159 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:37:34,163 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:37:34,173 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 88 transitions. [2022-03-15 17:37:34,173 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:37:39,823 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [31214#(and (or (not (<= 0 (+ ~top~0 2147483648))) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (not (= (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (not (<= ~top~0 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (not (= (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (not (<= ~top~0 2147483647)) (<= |t1Thread1of1ForFork0_push_~x#1| 399) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (or (not (<= 0 (+ ~top~0 2147483648))) (= (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)) (not (<= ~top~0 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (or (not (<= 0 (+ ~top~0 2147483648))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (<= ~top~0 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) 399)) (or (not (<= 0 (+ ~top~0 2147483648))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (<= ~top~0 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 399)) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (= (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (not (= (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (not (<= ~top~0 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (not (= (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (not (<= ~top~0 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (<= |t1Thread1of1ForFork0_push_~x#1| 399)) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (= ((as const (Array Int Int)) 0) (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (or (not (<= 0 (+ ~top~0 2147483648))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (<= ~top~0 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (or (not (<= 0 (+ ~top~0 2147483648))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (<= ~top~0 2147483647)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (= (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) 399)) (or (not (<= 0 (+ ~top~0 2147483648))) (= (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)) (not (<= ~top~0 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 399))), 31213#(and (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (and (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 399) (not (and (= (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)))) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (and (= (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= |t1Thread1of1ForFork0_push_~x#1| 399))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (= ((as const (Array Int Int)) 0) (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648)))) (or (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= |t1Thread1of1ForFork0_push_~x#1| 399) (= (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)))) (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (and (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))))) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) 399)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648)))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)))))) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (and (= (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)))) (and (= (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_~stack#1.base|) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|)))), 31215#(and (or (not (<= 0 (+ ~top~0 2147483648))) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (not (<= ~top~0 2147483647)) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (<= |t1Thread1of1ForFork0_push_#in~x#1| 399) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (= 400 ~top~0)) (or (not (<= 0 (+ ~top~0 2147483648))) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (<= 0 |t1Thread1of1ForFork0_push_#in~x#1|) (not (<= ~top~0 2147483647)) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (= 400 ~top~0)) (or (not (<= 0 (+ ~top~0 2147483648))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (<= ~top~0 2147483647)) (= 400 ~top~0) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (or (not (<= 0 (+ ~top~0 2147483648))) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 399) (not (<= ~top~0 2147483647)) (= 400 ~top~0) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) 399) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (= 400 ~top~0) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (= 400 ~top~0) (= ((as const (Array Int Int)) 0) (store (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (or (not (<= 0 (+ ~top~0 2147483648))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (<= ~top~0 2147483647)) (= 400 ~top~0) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (or (not (<= 0 (+ ~top~0 2147483648))) (<= 0 |t1Thread1of1ForFork0_push_#in~x#1|) (not (<= ~top~0 2147483647)) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (= 400 ~top~0) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (or (not (<= 0 (+ ~top~0 2147483648))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (not (<= ~top~0 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (= 400 ~top~0) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (or (not (<= 0 (+ ~top~0 2147483648))) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 399) (not (<= ~top~0 2147483647)) (= 400 ~top~0) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) 399) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (= 400 ~top~0) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (or (not (<= 0 (+ ~top~0 2147483648))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)))) (not (<= ~top~0 2147483647)) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0))) (= 400 ~top~0) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (<= |t1Thread1of1ForFork0_push_#in~x#1| 399) (= 400 ~top~0) (<= (+ |~#arr~0.offset| (* ~top~0 4)) (@diff (store (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) (@diff (select (store |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |#memory_int| |t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) |t1Thread1of1ForFork0_push_#in~x#1|)) |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))] [2022-03-15 17:37:39,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 17:37:39,823 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:37:39,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 17:37:39,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=3939, Unknown=14, NotChecked=128, Total=4422 [2022-03-15 17:37:39,824 INFO L87 Difference]: Start difference. First operand 989 states and 2345 transitions. Second operand has 26 states, 25 states have (on average 1.96) internal successors, (49), 25 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 17:38:08,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:38:08,074 INFO L93 Difference]: Finished difference Result 1547 states and 3517 transitions. [2022-03-15 17:38:08,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 17:38:08,076 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.96) internal successors, (49), 25 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 36 [2022-03-15 17:38:08,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:38:08,080 INFO L225 Difference]: With dead ends: 1547 [2022-03-15 17:38:08,080 INFO L226 Difference]: Without dead ends: 1466 [2022-03-15 17:38:08,082 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 38 SyntacticMatches, 9 SemanticMatches, 92 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2024 ImplicationChecksByTransitivity, 89.3s TimeCoverageRelationStatistics Valid=866, Invalid=7678, Unknown=16, NotChecked=182, Total=8742 [2022-03-15 17:38:08,082 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 350 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 1521 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-03-15 17:38:08,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 5 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1521 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-03-15 17:38:08,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2022-03-15 17:38:08,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1050. [2022-03-15 17:38:08,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 1048 states have (on average 2.3730916030534353) internal successors, (2487), 1049 states have internal predecessors, (2487), 0 states have call successors, (0), 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 17:38:08,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 2487 transitions. [2022-03-15 17:38:08,105 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 2487 transitions. Word has length 36 [2022-03-15 17:38:08,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:38:08,106 INFO L470 AbstractCegarLoop]: Abstraction has 1050 states and 2487 transitions. [2022-03-15 17:38:08,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.96) internal successors, (49), 25 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 17:38:08,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 2487 transitions. [2022-03-15 17:38:08,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 17:38:08,107 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:38:08,108 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:38:08,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-03-15 17:38:08,323 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,SelfDestructingSolverStorable16 [2022-03-15 17:38:08,324 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:38:08,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:38:08,324 INFO L85 PathProgramCache]: Analyzing trace with hash 941284393, now seen corresponding path program 3 times [2022-03-15 17:38:08,325 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:38:08,325 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197900757] [2022-03-15 17:38:08,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:38:08,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:38:08,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:38:09,065 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:38:09,065 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:38:09,065 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197900757] [2022-03-15 17:38:09,065 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197900757] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:38:09,065 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260662248] [2022-03-15 17:38:09,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 17:38:09,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:38:09,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:38:09,067 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 17:38:09,098 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 17:38:09,219 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 17:38:09,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:38:09,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 90 conjunts are in the unsatisfiable core [2022-03-15 17:38:09,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:38:09,243 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-15 17:38:09,244 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 20 treesize of output 22 [2022-03-15 17:38:09,549 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 19 treesize of output 15 [2022-03-15 17:38:09,786 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 56 treesize of output 50 [2022-03-15 17:38:10,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:38:10,148 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 65 treesize of output 48 [2022-03-15 17:38:11,077 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 92 treesize of output 56 [2022-03-15 17:38:50,260 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:38:50,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:38:58,249 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_188| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_136| Int) (v_ArrVal_833 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_188| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_188|) |v_t1Thread1of1ForFork0_push_~stack#1.offset_136|) v_ArrVal_833)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_136|)))) is different from false [2022-03-15 17:39:14,748 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-03-15 17:39:14,755 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#arr~0.base|) (+ (* 4 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|) |c_~#arr~0.offset|)) 4294967296) 4294967294))) is different from false [2022-03-15 17:39:14,760 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) is different from false [2022-03-15 17:39:14,767 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:39:14,767 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 29 treesize of output 30 [2022-03-15 17:39:14,774 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:39:14,774 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 49 treesize of output 52 [2022-03-15 17:39:14,777 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 28 treesize of output 22 [2022-03-15 17:39:15,049 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-03-15 17:39:15,050 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260662248] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:39:15,050 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:39:15,050 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 20] total 64 [2022-03-15 17:39:15,050 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1547613385] [2022-03-15 17:39:15,050 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:39:15,054 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:39:15,065 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 88 transitions. [2022-03-15 17:39:15,065 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:39:17,241 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [35200#(and (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 2147483647) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (<= (* ~top~0 4) 0)), 35193#(and (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (= |~#arr~0.offset| 0) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648)))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (< (* ~top~0 4) 4) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (+ (* ~top~0 4) (- 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))) (<= 0 |t1Thread1of1ForFork0_push_~x#1|)) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (and (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (+ (* ~top~0 4) (- 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4)))))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (and (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (+ (* ~top~0 4) (- 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))))) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647)) (< (* ~top~0 4) 4) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (+ (* ~top~0 4) (- 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647)))), 35195#(and (or (not (<= ~top~0 2147483647)) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ (* ~top~0 4) (- 4))) (< (* ~top~0 4) 4) (= 400 ~top~0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647)) (or (<= |t1Thread1of1ForFork0_push_#in~x#1| 2147483647) (not (<= ~top~0 2147483647)) (< (* ~top~0 4) 4) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (= 400 ~top~0) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ (* ~top~0 4) (- 4))))) (or (not (<= 0 (+ ~top~0 2147483648))) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647)) (= 400 ~top~0)) (or (<= 0 |t1Thread1of1ForFork0_push_#in~x#1|) (not (<= ~top~0 2147483647)) (< (* ~top~0 4) 4) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (= 400 ~top~0) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ (* ~top~0 4) (- 4))))) (or (not (<= ~top~0 2147483647)) (< (* ~top~0 4) 4) (= 400 ~top~0) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647)) (or (not (<= ~top~0 2147483647)) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ (* ~top~0 4) (- 4))) (< (* ~top~0 4) 4) (= 400 ~top~0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (or (not (<= ~top~0 2147483647)) (< (* ~top~0 4) 4) (= 400 ~top~0) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4)))))), 35196#(and (or (< 2147483647 ~top~0) (< (* ~top~0 4) 4) (= 400 ~top~0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (or (< 2147483647 ~top~0) (< (* ~top~0 4) 4) (= 400 ~top~0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647)) (or (< 2147483647 ~top~0) (= |~#arr~0.offset| 0) (< (+ ~top~0 2147483648) 0) (= 400 ~top~0))), 35199#(and (<= (select (select |#memory_int| |~#arr~0.base|) (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4)) 2147483647) (= |~#arr~0.offset| 0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4))) (<= (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4) 0)), 35197#(and (or (= |~#arr~0.offset| 0) (< 2147483646 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (< (+ 2147483649 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) 0) (= 400 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1))) (or (<= (select (select |#memory_int| |~#arr~0.base|) (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4)) 2147483647) (< 2147483646 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (< (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4) 0) (= 400 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1))) (or (< 2147483646 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4))) (< (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4) 0) (= 400 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1)))), 35198#(and (or (= |~#arr~0.offset| 0) (< (+ 2147483649 ~top~0) 0) (= 400 (+ ~top~0 1)) (< 2147483646 ~top~0)) (or (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 2147483647) (< (* ~top~0 4) 0) (= 400 (+ ~top~0 1)) (< 2147483646 ~top~0)) (or (< (* ~top~0 4) 0) (= 400 (+ ~top~0 1)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (< 2147483646 ~top~0))), 35194#(and (or (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (<= ~top~0 2147483647)) (< (* ~top~0 4) 4) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647)) (or (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (not (<= ~top~0 2147483647)) (< (* ~top~0 4) 4) (not (= (+ (* ~top~0 4) (- 4)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647)) (or (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (not (<= ~top~0 2147483647)) (< (* ~top~0 4) 4) (not (= (+ (* ~top~0 4) (- 4)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)))) (or (not (<= ~top~0 2147483647)) (< (* ~top~0 4) 4) (= (+ (* ~top~0 4) (- 4)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647)) (or (not (<= 0 (+ ~top~0 2147483648))) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647))) (or (not (<= ~top~0 2147483647)) (< (* ~top~0 4) 4) (= (+ (* ~top~0 4) (- 4)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (or (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (<= ~top~0 2147483647)) (< (* ~top~0 4) 4) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))))] [2022-03-15 17:39:17,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 17:39:17,241 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:39:17,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 17:39:17,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=4467, Unknown=25, NotChecked=556, Total=5402 [2022-03-15 17:39:17,243 INFO L87 Difference]: Start difference. First operand 1050 states and 2487 transitions. Second operand has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 33 states have internal predecessors, (63), 0 states have call successors, (0), 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 17:39:26,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:39:26,685 INFO L93 Difference]: Finished difference Result 1849 states and 4182 transitions. [2022-03-15 17:39:26,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-15 17:39:26,685 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 33 states have internal predecessors, (63), 0 states have call successors, (0), 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 17:39:26,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:39:26,690 INFO L225 Difference]: With dead ends: 1849 [2022-03-15 17:39:26,690 INFO L226 Difference]: Without dead ends: 1849 [2022-03-15 17:39:26,691 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 36 SyntacticMatches, 10 SemanticMatches, 119 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 4272 ImplicationChecksByTransitivity, 73.3s TimeCoverageRelationStatistics Valid=1253, Invalid=12310, Unknown=25, NotChecked=932, Total=14520 [2022-03-15 17:39:26,692 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 457 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 2826 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 17:39:26,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [457 Valid, 0 Invalid, 2931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2826 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 17:39:26,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2022-03-15 17:39:26,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 1143. [2022-03-15 17:39:26,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 1141 states have (on average 2.3637160385626643) internal successors, (2697), 1142 states have internal predecessors, (2697), 0 states have call successors, (0), 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 17:39:26,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 2697 transitions. [2022-03-15 17:39:26,714 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 2697 transitions. Word has length 36 [2022-03-15 17:39:26,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:39:26,714 INFO L470 AbstractCegarLoop]: Abstraction has 1143 states and 2697 transitions. [2022-03-15 17:39:26,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 33 states have internal predecessors, (63), 0 states have call successors, (0), 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 17:39:26,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 2697 transitions. [2022-03-15 17:39:26,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 17:39:26,716 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:39:26,716 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:39:26,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-03-15 17:39:26,939 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,SelfDestructingSolverStorable17 [2022-03-15 17:39:26,940 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:39:26,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:39:26,940 INFO L85 PathProgramCache]: Analyzing trace with hash -217993061, now seen corresponding path program 4 times [2022-03-15 17:39:26,942 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:39:26,942 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114431810] [2022-03-15 17:39:26,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:39:26,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:39:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:39:28,300 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:39:28,300 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:39:28,300 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114431810] [2022-03-15 17:39:28,300 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114431810] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:39:28,300 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099825526] [2022-03-15 17:39:28,300 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 17:39:28,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:39:28,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:39:28,302 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 17:39:28,302 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 17:39:28,414 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 17:39:28,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:39:28,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 85 conjunts are in the unsatisfiable core [2022-03-15 17:39:28,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:39:28,439 INFO L353 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-03-15 17:39:28,439 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 29 treesize of output 34 [2022-03-15 17:39:28,785 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 19 treesize of output 15 [2022-03-15 17:39:29,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:39:29,315 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 65 treesize of output 48 [2022-03-15 17:39:29,502 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 56 treesize of output 50 [2022-03-15 17:39:30,521 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 92 treesize of output 56 [2022-03-15 17:39:39,157 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:39:39,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:39:39,983 WARN L838 $PredicateComparison]: unable to prove that (or (= (+ (- 1) c_~top~0) 0) (forall ((v_ArrVal_904 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_904) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))))) is different from false [2022-03-15 17:39:39,991 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_904 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_904) |c_~#arr~0.base|) (+ (* 4 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|) |c_~#arr~0.offset| (- 4))) 4294967296) 4294967294))) (= |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 0)) is different from false [2022-03-15 17:39:39,999 WARN L838 $PredicateComparison]: unable to prove that (or (= c_~top~0 0) (forall ((v_ArrVal_904 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_904) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))))) is different from false [2022-03-15 17:39:40,008 WARN L838 $PredicateComparison]: unable to prove that (or (= c_~top~0 0) (forall ((v_ArrVal_904 (Array Int Int)) (v_ArrVal_903 Int)) (not (= (mod (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_903)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_904) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)))) is different from false [2022-03-15 17:39:40,025 WARN L838 $PredicateComparison]: unable to prove that (or (= c_~top~0 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_203| Int) (v_ArrVal_904 (Array Int Int)) (v_ArrVal_903 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_203| c_~top~0) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_203|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_903)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_904) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) is different from false [2022-03-15 17:39:40,060 WARN L838 $PredicateComparison]: unable to prove that (or (= c_~top~0 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_203| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_145| Int) (v_ArrVal_904 (Array Int Int)) (v_ArrVal_903 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_203| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_145|)) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_203|) |v_t1Thread1of1ForFork0_push_~stack#1.offset_145|) v_ArrVal_903)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_904) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) is different from false [2022-03-15 17:39:40,094 WARN L838 $PredicateComparison]: unable to prove that (or (= c_~top~0 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_203| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_145| Int) (v_ArrVal_904 (Array Int Int)) (v_ArrVal_903 Int)) (or (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (select |c_#memory_int| |c_~#arr~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_203|) |v_t1Thread1of1ForFork0_push_~stack#1.offset_145|) v_ArrVal_903)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_904) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_203| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_145| |c_~#arr~0.offset|)))) is different from false [2022-03-15 17:39:40,325 WARN L838 $PredicateComparison]: unable to prove that (or (= (+ c_~top~0 1) 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_203| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_145| Int) (v_ArrVal_904 (Array Int Int)) (v_ArrVal_903 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_203| (+ c_~top~0 1)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_145| |c_~#arr~0.offset|) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| (store (select |c_#memory_int| |c_~#arr~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_203|) |v_t1Thread1of1ForFork0_push_~stack#1.offset_145|) v_ArrVal_903)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_904) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))))) is different from false [2022-03-15 17:39:40,365 INFO L353 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2022-03-15 17:39:40,366 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 2 case distinctions, treesize of input 53 treesize of output 60 [2022-03-15 17:39:40,377 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:39:40,378 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 67 treesize of output 70 [2022-03-15 17:39:40,381 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 28 treesize of output 22 [2022-03-15 17:39:40,802 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-03-15 17:39:40,802 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099825526] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:39:40,802 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:39:40,802 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2022-03-15 17:39:40,802 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1892206032] [2022-03-15 17:39:40,802 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:39:40,806 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:39:40,814 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 54 transitions. [2022-03-15 17:39:40,814 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:39:41,567 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [39708#(and (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)) (or (<= (+ |~#arr~0.offset| (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4)) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0))))) (or (<= (+ |~#arr~0.offset| (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4)) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0))) (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0))) 399)) (or (<= 0 (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (<= (+ |~#arr~0.offset| (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4)) (@diff (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (or (<= (select (select |#memory_int| |~#arr~0.base|) (@diff (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) 399) (<= (+ |~#arr~0.offset| (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4)) (@diff (store (select |#memory_int| |~#arr~0.base|) (@diff (select |#memory_int| |~#arr~0.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))] [2022-03-15 17:39:41,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 17:39:41,568 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:39:41,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 17:39:41,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=3356, Unknown=17, NotChecked=1000, Total=4692 [2022-03-15 17:39:41,568 INFO L87 Difference]: Start difference. First operand 1143 states and 2697 transitions. Second operand has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 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 17:39:52,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:39:52,577 INFO L93 Difference]: Finished difference Result 1737 states and 3921 transitions. [2022-03-15 17:39:52,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 17:39:52,578 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 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 17:39:52,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:39:52,582 INFO L225 Difference]: With dead ends: 1737 [2022-03-15 17:39:52,582 INFO L226 Difference]: Without dead ends: 1586 [2022-03-15 17:39:52,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 27 SyntacticMatches, 8 SemanticMatches, 92 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1876 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=905, Invalid=6419, Unknown=18, NotChecked=1400, Total=8742 [2022-03-15 17:39:52,583 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 476 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 1468 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 17:39:52,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [476 Valid, 5 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1468 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 17:39:52,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2022-03-15 17:39:52,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1093. [2022-03-15 17:39:52,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 1091 states have (on average 2.3519706691109072) internal successors, (2566), 1092 states have internal predecessors, (2566), 0 states have call successors, (0), 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 17:39:52,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 2566 transitions. [2022-03-15 17:39:52,602 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 2566 transitions. Word has length 36 [2022-03-15 17:39:52,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:39:52,602 INFO L470 AbstractCegarLoop]: Abstraction has 1093 states and 2566 transitions. [2022-03-15 17:39:52,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 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 17:39:52,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 2566 transitions. [2022-03-15 17:39:52,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-15 17:39:52,604 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:39:52,604 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:39:52,629 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 17:39:52,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:39:52,823 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:39:52,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:39:52,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1321323465, now seen corresponding path program 3 times [2022-03-15 17:39:52,825 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:39:52,825 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772046938] [2022-03-15 17:39:52,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:39:52,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:39:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:39:52,934 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 17:39:52,934 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:39:52,934 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772046938] [2022-03-15 17:39:52,935 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772046938] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:39:52,935 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949154999] [2022-03-15 17:39:52,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 17:39:52,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:39:52,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:39:52,947 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 17:39:52,967 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 17:39:53,087 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 17:39:53,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:39:53,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 17:39:53,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:39:53,193 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-03-15 17:39:53,194 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 17:39:53,194 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949154999] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:39:53,194 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 17:39:53,194 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2022-03-15 17:39:53,194 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [417776594] [2022-03-15 17:39:53,194 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:39:53,199 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:39:53,245 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 134 transitions. [2022-03-15 17:39:53,245 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:39:53,360 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:39:53,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 17:39:53,361 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:39:53,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 17:39:53,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-03-15 17:39:53,361 INFO L87 Difference]: Start difference. First operand 1093 states and 2566 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 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 17:39:53,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:39:53,509 INFO L93 Difference]: Finished difference Result 1371 states and 3151 transitions. [2022-03-15 17:39:53,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 17:39:53,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 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 38 [2022-03-15 17:39:53,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:39:53,513 INFO L225 Difference]: With dead ends: 1371 [2022-03-15 17:39:53,513 INFO L226 Difference]: Without dead ends: 1371 [2022-03-15 17:39:53,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2022-03-15 17:39:53,514 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 62 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:39:53,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 2 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:39:53,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2022-03-15 17:39:53,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1111. [2022-03-15 17:39:53,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 1109 states have (on average 2.3651938683498646) internal successors, (2623), 1110 states have internal predecessors, (2623), 0 states have call successors, (0), 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 17:39:53,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 2623 transitions. [2022-03-15 17:39:53,536 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 2623 transitions. Word has length 38 [2022-03-15 17:39:53,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:39:53,536 INFO L470 AbstractCegarLoop]: Abstraction has 1111 states and 2623 transitions. [2022-03-15 17:39:53,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 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 17:39:53,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 2623 transitions. [2022-03-15 17:39:53,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-15 17:39:53,538 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:39:53,538 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:39:53,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-03-15 17:39:53,751 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,SelfDestructingSolverStorable19 [2022-03-15 17:39:53,751 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:39:53,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:39:53,752 INFO L85 PathProgramCache]: Analyzing trace with hash -357370697, now seen corresponding path program 4 times [2022-03-15 17:39:53,753 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:39:53,753 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566221705] [2022-03-15 17:39:53,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:39:53,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:39:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:39:53,877 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 17:39:53,878 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:39:53,878 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566221705] [2022-03-15 17:39:53,878 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566221705] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:39:53,878 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412926471] [2022-03-15 17:39:53,878 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 17:39:53,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:39:53,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:39:53,880 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 17:39:53,890 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 17:39:54,018 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 17:39:54,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:39:54,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 17:39:54,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:39:54,083 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 17:39:54,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:39:54,186 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 17:39:54,186 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412926471] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:39:54,186 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:39:54,186 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2022-03-15 17:39:54,186 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2030807899] [2022-03-15 17:39:54,186 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:39:54,191 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:39:54,203 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 78 transitions. [2022-03-15 17:39:54,203 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:39:54,401 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [47656#(or (< 2147483647 ~top~0) (<= ~top~0 0)), 47655#(or (< (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648) 0) (< 2147483647 |t1Thread1of1ForFork0_push_#t~ret35#1|) (<= ~top~0 0)), 47657#(or (< 2147483647 ~top~0) (= 400 ~top~0) (<= ~top~0 0))] [2022-03-15 17:39:54,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 17:39:54,401 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:39:54,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 17:39:54,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2022-03-15 17:39:54,402 INFO L87 Difference]: Start difference. First operand 1111 states and 2623 transitions. Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 14 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 17:39:54,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:39:54,825 INFO L93 Difference]: Finished difference Result 1473 states and 3328 transitions. [2022-03-15 17:39:54,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 17:39:54,826 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 14 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 38 [2022-03-15 17:39:54,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:39:54,831 INFO L225 Difference]: With dead ends: 1473 [2022-03-15 17:39:54,831 INFO L226 Difference]: Without dead ends: 1473 [2022-03-15 17:39:54,831 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2022-03-15 17:39:54,832 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 170 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 17:39:54,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 3 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 17:39:54,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2022-03-15 17:39:54,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1111. [2022-03-15 17:39:54,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 1109 states have (on average 2.3651938683498646) internal successors, (2623), 1110 states have internal predecessors, (2623), 0 states have call successors, (0), 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 17:39:54,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 2623 transitions. [2022-03-15 17:39:54,849 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 2623 transitions. Word has length 38 [2022-03-15 17:39:54,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:39:54,849 INFO L470 AbstractCegarLoop]: Abstraction has 1111 states and 2623 transitions. [2022-03-15 17:39:54,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 14 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 17:39:54,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 2623 transitions. [2022-03-15 17:39:54,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-15 17:39:54,851 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:39:54,851 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2022-03-15 17:39:54,875 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 17:39:55,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:39:55,070 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:39:55,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:39:55,071 INFO L85 PathProgramCache]: Analyzing trace with hash 48552593, now seen corresponding path program 5 times [2022-03-15 17:39:55,072 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:39:55,072 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637194976] [2022-03-15 17:39:55,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:39:55,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:39:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:39:55,251 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 5 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:39:55,252 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:39:55,252 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637194976] [2022-03-15 17:39:55,252 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637194976] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:39:55,252 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669904897] [2022-03-15 17:39:55,252 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 17:39:55,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:39:55,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:39:55,256 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 17:39:55,257 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 17:39:55,420 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 17:39:55,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:39:55,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 17:39:55,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:39:55,526 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 5 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:39:55,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:39:55,711 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 5 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:39:55,712 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669904897] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:39:55,712 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:39:55,712 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 29 [2022-03-15 17:39:55,712 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1636219421] [2022-03-15 17:39:55,715 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:39:55,731 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:39:55,741 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 41 transitions. [2022-03-15 17:39:55,741 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:39:55,741 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:39:55,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 17:39:55,742 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:39:55,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 17:39:55,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2022-03-15 17:39:55,742 INFO L87 Difference]: Start difference. First operand 1111 states and 2623 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:39:56,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:39:56,045 INFO L93 Difference]: Finished difference Result 1513 states and 3449 transitions. [2022-03-15 17:39:56,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 17:39:56,045 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-03-15 17:39:56,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:39:56,049 INFO L225 Difference]: With dead ends: 1513 [2022-03-15 17:39:56,049 INFO L226 Difference]: Without dead ends: 1513 [2022-03-15 17:39:56,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=365, Invalid=895, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 17:39:56,050 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 251 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 17:39:56,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 4 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 17:39:56,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2022-03-15 17:39:56,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1187. [2022-03-15 17:39:56,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 1185 states have (on average 2.367088607594937) internal successors, (2805), 1186 states have internal predecessors, (2805), 0 states have call successors, (0), 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 17:39:56,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 2805 transitions. [2022-03-15 17:39:56,071 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 2805 transitions. Word has length 41 [2022-03-15 17:39:56,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:39:56,071 INFO L470 AbstractCegarLoop]: Abstraction has 1187 states and 2805 transitions. [2022-03-15 17:39:56,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:39:56,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 2805 transitions. [2022-03-15 17:39:56,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-15 17:39:56,074 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:39:56,074 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:39:56,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-03-15 17:39:56,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:39:56,287 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:39:56,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:39:56,288 INFO L85 PathProgramCache]: Analyzing trace with hash -2048995106, now seen corresponding path program 6 times [2022-03-15 17:39:56,289 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:39:56,289 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698814415] [2022-03-15 17:39:56,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:39:56,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:39:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:39:56,621 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-15 17:39:56,621 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:39:56,621 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698814415] [2022-03-15 17:39:56,621 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698814415] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:39:56,621 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063673411] [2022-03-15 17:39:56,621 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 17:39:56,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:39:56,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:39:56,623 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 17:39:56,623 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 17:39:56,735 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-15 17:39:56,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:39:56,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 60 conjunts are in the unsatisfiable core [2022-03-15 17:39:56,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:39:56,756 INFO L353 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-03-15 17:39:56,757 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 29 treesize of output 34 [2022-03-15 17:39:57,085 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 19 treesize of output 15 [2022-03-15 17:39:57,164 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 76 treesize of output 70 [2022-03-15 17:39:57,670 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 128 treesize of output 56 [2022-03-15 17:40:00,680 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-15 17:40:00,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:40:01,055 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1228 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1228) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-03-15 17:40:01,063 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:40:01,063 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 29 treesize of output 30 [2022-03-15 17:40:01,071 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:40:01,071 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 49 treesize of output 52 [2022-03-15 17:40:01,074 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 28 treesize of output 22 [2022-03-15 17:40:01,359 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-15 17:40:01,359 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063673411] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:40:01,360 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:40:01,360 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2022-03-15 17:40:01,360 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [565134405] [2022-03-15 17:40:01,360 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:40:01,366 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:40:01,378 INFO L252 McrAutomatonBuilder]: Finished intersection with 52 states and 60 transitions. [2022-03-15 17:40:01,378 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:40:01,481 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:40:01,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 17:40:01,481 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:40:01,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 17:40:01,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1670, Unknown=1, NotChecked=82, Total=1892 [2022-03-15 17:40:01,482 INFO L87 Difference]: Start difference. First operand 1187 states and 2805 transitions. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 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 17:40:05,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:40:05,691 INFO L93 Difference]: Finished difference Result 1603 states and 3674 transitions. [2022-03-15 17:40:05,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 17:40:05,691 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 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 42 [2022-03-15 17:40:05,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:40:05,694 INFO L225 Difference]: With dead ends: 1603 [2022-03-15 17:40:05,694 INFO L226 Difference]: Without dead ends: 1565 [2022-03-15 17:40:05,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=519, Invalid=3905, Unknown=2, NotChecked=130, Total=4556 [2022-03-15 17:40:05,695 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 329 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 17:40:05,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [329 Valid, 0 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 17:40:05,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2022-03-15 17:40:05,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1015. [2022-03-15 17:40:05,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1013 states have (on average 2.3385982230997038) internal successors, (2369), 1014 states have internal predecessors, (2369), 0 states have call successors, (0), 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 17:40:05,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 2369 transitions. [2022-03-15 17:40:05,710 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 2369 transitions. Word has length 42 [2022-03-15 17:40:05,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:40:05,710 INFO L470 AbstractCegarLoop]: Abstraction has 1015 states and 2369 transitions. [2022-03-15 17:40:05,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 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 17:40:05,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 2369 transitions. [2022-03-15 17:40:05,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-15 17:40:05,712 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:40:05,712 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:40:05,735 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 17:40:05,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-03-15 17:40:05,927 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:40:05,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:40:05,928 INFO L85 PathProgramCache]: Analyzing trace with hash -2054209314, now seen corresponding path program 5 times [2022-03-15 17:40:05,929 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:40:05,929 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784356514] [2022-03-15 17:40:05,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:40:05,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:40:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:40:06,411 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 17:40:06,411 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:40:06,411 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784356514] [2022-03-15 17:40:06,412 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784356514] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:40:06,412 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518112439] [2022-03-15 17:40:06,412 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 17:40:06,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:40:06,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:40:06,416 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 17:40:06,417 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 17:40:06,582 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 17:40:06,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:40:06,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 83 conjunts are in the unsatisfiable core [2022-03-15 17:40:06,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:40:07,013 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 19 treesize of output 15 [2022-03-15 17:40:07,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:40:07,557 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 75 treesize of output 50 [2022-03-15 17:40:08,513 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 92 treesize of output 56 [2022-03-15 17:40:08,774 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:40:08,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:40:44,416 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-03-15 17:40:44,608 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 17:40:44,608 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518112439] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:40:44,608 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:40:44,609 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22, 19] total 59 [2022-03-15 17:40:44,609 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1326116188] [2022-03-15 17:40:44,609 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:40:44,614 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:40:44,635 INFO L252 McrAutomatonBuilder]: Finished intersection with 92 states and 139 transitions. [2022-03-15 17:40:44,635 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:40:47,992 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [59826#(and (or (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (<= |t1Thread1of1ForFork0_push_~x#1| 399) (not (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|)) (< (+ ~top~0 2147483648) 0) (= ~top~0 399) (< 2147483646 ~top~0)) (or (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (not (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|)) (< (+ ~top~0 2147483648) 0) (= ~top~0 399) (< 2147483646 ~top~0)) (or (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (< (+ ~top~0 2147483648) 0) (= ~top~0 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (< 2147483646 ~top~0)) (or (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (< (+ ~top~0 2147483648) 0) (= ~top~0 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (< 2147483646 ~top~0)) (or (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_~stack#1.offset|) (< (+ ~top~0 2147483648) 0) (= ~top~0 399) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 399) (< 2147483646 ~top~0)) (or (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (< (+ ~top~0 2147483648) 0) (= ~top~0 399) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 399) (< 2147483646 ~top~0))), 59824#(and (or (< (+ 2147483649 ~top~0) 0) (= 400 (+ ~top~0 1)) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 399) (< 2147483646 ~top~0)) (or (< (+ 2147483649 ~top~0) 0) (= 400 (+ ~top~0 1)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (< 2147483646 ~top~0))), 59822#(and (or (< 2147483647 ~top~0) (< (+ ~top~0 2147483648) 0) (= 400 ~top~0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 399)) (or (< 2147483647 ~top~0) (< (+ ~top~0 2147483648) 0) (= 400 ~top~0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))))), 59823#(and (or (< 2147483646 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4))) 399) (< (+ 2147483649 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) 0) (= 400 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1))) (or (< 2147483646 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4)))) (< (+ 2147483649 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) 0) (= 400 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1)))), 59827#(and (or (< (+ ~top~0 2147483648) 0) (not (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_#in~stack#1.offset|)) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (<= |t1Thread1of1ForFork0_push_#in~x#1| 399) (= 400 ~top~0) (= ~top~0 399) (< 2147483646 ~top~0)) (or (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (+ ~top~0 2147483648) 0) (= 400 ~top~0) (= ~top~0 399) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 399) (< 2147483646 ~top~0)) (or (< (+ ~top~0 2147483648) 0) (= 400 ~top~0) (= ~top~0 399) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (< 2147483646 ~top~0)) (or (< (+ ~top~0 2147483648) 0) (= 400 ~top~0) (= ~top~0 399) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 399) (< 2147483646 ~top~0)) (or (<= 0 |t1Thread1of1ForFork0_push_#in~x#1|) (< (+ ~top~0 2147483648) 0) (not (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_#in~stack#1.offset|)) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (= 400 ~top~0) (= ~top~0 399) (< 2147483646 ~top~0)) (or (= |~#arr~0.offset| |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (+ ~top~0 2147483648) 0) (= 400 ~top~0) (= ~top~0 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (< 2147483646 ~top~0))), 59820#(and (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) (or (not (<= 0 (+ ~top~0 2147483648))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (<= ~top~0 2147483647)) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 399)) (or (not (<= 0 (+ ~top~0 2147483648))) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (not (<= ~top~0 2147483647))) (or (not (<= 0 (+ ~top~0 2147483648))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (<= ~top~0 2147483647)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 399) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (not (<= ~top~0 2147483647)) (<= |t1Thread1of1ForFork0_push_~x#1| 399))), 59821#(and (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (= 400 ~top~0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (<= |t1Thread1of1ForFork0_push_#in~x#1| 399) (= 400 ~top~0) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (= 400 ~top~0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (= 400 ~top~0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 399) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) (or (not (<= 0 (+ ~top~0 2147483648))) (<= 0 |t1Thread1of1ForFork0_push_#in~x#1|) (not (<= ~top~0 2147483647)) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (= 400 ~top~0) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (= 400 ~top~0) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 399))), 59825#(and (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (< (+ 2147483649 ~top~0) 0) (= 400 (+ ~top~0 1)) (and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4)))) (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (+ |~#arr~0.offset| (* ~top~0 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)))))) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= (+ |~#arr~0.offset| (* ~top~0 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)))) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (< 2147483646 ~top~0)) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (< (+ 2147483649 ~top~0) 0) (= 400 (+ ~top~0 1)) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= |t1Thread1of1ForFork0_push_~x#1| 399) (= (+ |~#arr~0.offset| (* ~top~0 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)))) (and (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (+ |~#arr~0.offset| (* ~top~0 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))))) (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4))) 399)) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (< 2147483646 ~top~0))), 59819#(and (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= (+ |~#arr~0.offset| (* ~top~0 4) (- 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)))) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4)))) (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (+ |~#arr~0.offset| (* ~top~0 4) (- 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))))))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ |~#arr~0.offset| (* ~top~0 4) (- 4))) 399) (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (+ |~#arr~0.offset| (* ~top~0 4) (- 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)))))) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= |t1Thread1of1ForFork0_push_~x#1| 399) (= (+ |~#arr~0.offset| (* ~top~0 4) (- 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)))) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648)))))] [2022-03-15 17:40:47,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 17:40:47,993 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:40:47,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 17:40:47,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=4437, Unknown=6, NotChecked=0, Total=4692 [2022-03-15 17:40:47,993 INFO L87 Difference]: Start difference. First operand 1015 states and 2369 transitions. Second operand has 29 states, 28 states have (on average 2.7857142857142856) internal successors, (78), 29 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 17:40:54,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:40:54,958 INFO L93 Difference]: Finished difference Result 2612 states and 5958 transitions. [2022-03-15 17:40:54,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-15 17:40:54,958 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.7857142857142856) internal successors, (78), 29 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 43 [2022-03-15 17:40:54,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:40:54,963 INFO L225 Difference]: With dead ends: 2612 [2022-03-15 17:40:54,963 INFO L226 Difference]: Without dead ends: 2612 [2022-03-15 17:40:54,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 114 SyntacticMatches, 5 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3912 ImplicationChecksByTransitivity, 43.6s TimeCoverageRelationStatistics Valid=1647, Invalid=13353, Unknown=6, NotChecked=0, Total=15006 [2022-03-15 17:40:54,965 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 628 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 2880 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 2880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 17:40:54,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [628 Valid, 0 Invalid, 3044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 2880 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 17:40:54,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2612 states. [2022-03-15 17:40:54,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2612 to 1378. [2022-03-15 17:40:54,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 1376 states have (on average 2.4295058139534884) internal successors, (3343), 1377 states have internal predecessors, (3343), 0 states have call successors, (0), 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 17:40:54,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 3343 transitions. [2022-03-15 17:40:54,987 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 3343 transitions. Word has length 43 [2022-03-15 17:40:54,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:40:54,987 INFO L470 AbstractCegarLoop]: Abstraction has 1378 states and 3343 transitions. [2022-03-15 17:40:54,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.7857142857142856) internal successors, (78), 29 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 17:40:54,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 3343 transitions. [2022-03-15 17:40:54,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-15 17:40:54,989 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:40:54,989 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:40:55,012 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 17:40:55,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:40:55,208 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:40:55,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:40:55,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1722648764, now seen corresponding path program 6 times [2022-03-15 17:40:55,210 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:40:55,210 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591167016] [2022-03-15 17:40:55,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:40:55,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:40:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:40:55,900 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 17:40:55,901 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:40:55,901 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591167016] [2022-03-15 17:40:55,901 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591167016] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:40:55,901 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366114054] [2022-03-15 17:40:55,901 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 17:40:55,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:40:55,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:40:55,902 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 17:40:55,904 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 17:40:56,113 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 17:40:56,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:40:56,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 90 conjunts are in the unsatisfiable core [2022-03-15 17:40:56,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:40:56,149 INFO L353 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-03-15 17:40:56,150 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 29 treesize of output 34 [2022-03-15 17:40:56,583 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 19 treesize of output 15 [2022-03-15 17:40:56,685 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 76 treesize of output 70 [2022-03-15 17:40:57,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:40:57,252 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 75 treesize of output 50 [2022-03-15 17:40:58,282 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 92 treesize of output 56 [2022-03-15 17:41:43,079 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:41:43,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:42:34,330 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1388 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1388) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) is different from false [2022-03-15 17:42:34,335 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:42:34,336 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 29 treesize of output 30 [2022-03-15 17:42:34,343 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:42:34,343 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 49 treesize of output 52 [2022-03-15 17:42:34,346 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 28 treesize of output 22 [2022-03-15 17:42:34,662 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 17:42:34,663 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366114054] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:42:34,663 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:42:34,663 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 20] total 66 [2022-03-15 17:42:34,663 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1189239858] [2022-03-15 17:42:34,663 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:42:34,668 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:42:34,684 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 95 transitions. [2022-03-15 17:42:34,684 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:42:36,695 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 8 treesize of output 4 [2022-03-15 17:42:36,709 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 8 treesize of output 4 [2022-03-15 17:42:36,724 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 8 treesize of output 4 [2022-03-15 17:42:38,007 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [65658#(and (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (= (+ (* ~top~0 4) (- 4)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (not (<= ~top~0 2147483647)) (<= |t1Thread1of1ForFork0_push_~x#1| 399) (not (= (+ (* ~top~0 4) (- 4)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)))) (or (not (<= 0 (+ ~top~0 2147483648))) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647))) (or (not (<= 0 (+ ~top~0 2147483648))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (<= ~top~0 2147483647)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (or (not (<= 0 (+ ~top~0 2147483648))) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (not (<= ~top~0 2147483647)) (= (+ (* ~top~0 4) (- 4)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (or (not (<= 0 (+ ~top~0 2147483648))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (not (<= ~top~0 2147483647))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (not (<= ~top~0 2147483647)) (not (= (+ (* ~top~0 4) (- 4)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))))), 65657#(and (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (= |~#arr~0.offset| 0) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648)))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (+ (* ~top~0 4) (- 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))) (<= 0 |t1Thread1of1ForFork0_push_~x#1|)) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (and (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (+ (* ~top~0 4) (- 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4)))))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (+ (* ~top~0 4) (- 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))) (<= |t1Thread1of1ForFork0_push_~x#1| 399)) (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (+ (* ~top~0 4) (- 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)))))))), 65660#(and (or (< 2147483647 ~top~0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (< (+ ~top~0 2147483648) 0) (= 400 ~top~0)) (or (< 2147483647 ~top~0) (< (+ ~top~0 2147483648) 0) (= 400 ~top~0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (or (< 2147483647 ~top~0) (= |~#arr~0.offset| 0) (< (+ ~top~0 2147483648) 0) (= 400 ~top~0))), 65662#(and (or (< (+ 2147483649 ~top~0) 0) (= 400 (+ ~top~0 1)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (< 2147483646 ~top~0)) (or (= |~#arr~0.offset| 0) (< (+ 2147483649 ~top~0) 0) (= 400 (+ ~top~0 1)) (< 2147483646 ~top~0)) (or (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 399) (< (+ 2147483649 ~top~0) 0) (= 400 (+ ~top~0 1)) (< 2147483646 ~top~0))), 65659#(and (or (not (<= 0 (+ ~top~0 2147483648))) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (not (<= ~top~0 2147483647)) (= 400 ~top~0) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (or (not (<= 0 (+ ~top~0 2147483648))) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647)) (= 400 ~top~0)) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ (* ~top~0 4) (- 4))) (= 400 ~top~0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (= 400 ~top~0) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (<= |t1Thread1of1ForFork0_push_#in~x#1| 399) (= 400 ~top~0) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ (* ~top~0 4) (- 4))))) (or (not (<= 0 (+ ~top~0 2147483648))) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (not (<= ~top~0 2147483647)) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ (* ~top~0 4) (- 4))) (= 400 ~top~0)) (or (not (<= 0 (+ ~top~0 2147483648))) (<= 0 |t1Thread1of1ForFork0_push_#in~x#1|) (not (<= ~top~0 2147483647)) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (= 400 ~top~0) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ (* ~top~0 4) (- 4)))))), 65661#(and (or (= |~#arr~0.offset| 0) (< 2147483646 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (< (+ 2147483649 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) 0) (= 400 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1))) (or (< 2147483646 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (<= (select (select |#memory_int| |~#arr~0.base|) (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4)) 399) (< (+ 2147483649 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) 0) (= 400 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1))) (or (< 2147483646 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4))) (< (+ 2147483649 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) 0) (= 400 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1))))] [2022-03-15 17:42:38,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 17:42:38,008 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:42:38,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 17:42:38,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=4953, Unknown=30, NotChecked=142, Total=5402 [2022-03-15 17:42:38,008 INFO L87 Difference]: Start difference. First operand 1378 states and 3343 transitions. Second operand has 31 states, 30 states have (on average 2.2) internal successors, (66), 30 states have internal predecessors, (66), 0 states have call successors, (0), 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 17:42:49,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:42:49,986 INFO L93 Difference]: Finished difference Result 2798 states and 6466 transitions. [2022-03-15 17:42:49,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-03-15 17:42:49,987 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.2) internal successors, (66), 30 states have internal predecessors, (66), 0 states have call successors, (0), 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 43 [2022-03-15 17:42:49,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:42:49,991 INFO L225 Difference]: With dead ends: 2798 [2022-03-15 17:42:49,991 INFO L226 Difference]: Without dead ends: 2798 [2022-03-15 17:42:49,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 134 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4924 ImplicationChecksByTransitivity, 109.9s TimeCoverageRelationStatistics Valid=2027, Invalid=16036, Unknown=31, NotChecked=266, Total=18360 [2022-03-15 17:42:49,992 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1081 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 2384 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 2384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 17:42:49,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1081 Valid, 0 Invalid, 2628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 2384 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 17:42:49,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2022-03-15 17:42:50,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 1059. [2022-03-15 17:42:50,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 1057 states have (on average 2.3651844843897822) internal successors, (2500), 1058 states have internal predecessors, (2500), 0 states have call successors, (0), 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 17:42:50,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 2500 transitions. [2022-03-15 17:42:50,014 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 2500 transitions. Word has length 43 [2022-03-15 17:42:50,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:42:50,014 INFO L470 AbstractCegarLoop]: Abstraction has 1059 states and 2500 transitions. [2022-03-15 17:42:50,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.2) internal successors, (66), 30 states have internal predecessors, (66), 0 states have call successors, (0), 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 17:42:50,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 2500 transitions. [2022-03-15 17:42:50,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 17:42:50,016 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:42:50,016 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:42:50,033 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 17:42:50,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:42:50,217 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:42:50,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:42:50,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1911587764, now seen corresponding path program 5 times [2022-03-15 17:42:50,219 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:42:50,219 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286511864] [2022-03-15 17:42:50,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:42:50,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:42:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:42:50,343 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 17:42:50,343 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:42:50,344 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286511864] [2022-03-15 17:42:50,344 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286511864] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:42:50,344 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706909798] [2022-03-15 17:42:50,344 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 17:42:50,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:42:50,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:42:50,345 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 17:42:50,380 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 17:42:50,594 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 17:42:50,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:42:50,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 17:42:50,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:42:50,701 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 17:42:50,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:42:50,863 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 17:42:50,863 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706909798] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:42:50,863 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:42:50,863 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2022-03-15 17:42:50,863 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [269200559] [2022-03-15 17:42:50,864 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:42:50,869 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:42:50,897 INFO L252 McrAutomatonBuilder]: Finished intersection with 94 states and 141 transitions. [2022-03-15 17:42:50,897 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:42:51,852 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [70993#(or (= 400 (+ ~top~0 1)) (<= ~top~0 1) (< 2147483646 ~top~0)), 70997#(or (= 400 (+ ~top~0 1)) (< 2147483645 ~top~0) (<= ~top~0 0) (= 399 (+ ~top~0 1))), 70999#(or (= 400 ~top~0) (= ~top~0 399) (< 2147483645 ~top~0) (= ~top~0 398) (<= ~top~0 0)), 70994#(or (< (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648) 0) (= ~top~0 399) (< 2147483647 |t1Thread1of1ForFork0_push_#t~ret35#1|) (<= ~top~0 1) (< 2147483646 ~top~0)), 70996#(or (= 399 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1)) (< 2147483645 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (<= |t1Thread1of1ForFork0_inc_top_#t~post31#1| 0) (= 400 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1))), 70989#(or (< (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648) 0) (<= ~top~0 2) (< 2147483647 |t1Thread1of1ForFork0_push_#t~ret35#1|)), 70990#(or (< 2147483647 ~top~0) (<= ~top~0 2)), 70991#(or (< 2147483647 ~top~0) (= 400 ~top~0) (<= ~top~0 2)), 70998#(or (< (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648) 0) (= ~top~0 399) (< 2147483647 |t1Thread1of1ForFork0_push_#t~ret35#1|) (< 2147483645 ~top~0) (= ~top~0 398) (<= ~top~0 0)), 70992#(or (< 2147483646 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (<= |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1) (= 400 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1))), 70995#(or (= 400 ~top~0) (= ~top~0 399) (<= ~top~0 1) (< 2147483646 ~top~0))] [2022-03-15 17:42:51,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 17:42:51,853 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:42:51,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 17:42:51,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=875, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 17:42:51,854 INFO L87 Difference]: Start difference. First operand 1059 states and 2500 transitions. Second operand has 23 states, 23 states have (on average 3.608695652173913) internal successors, (83), 22 states have internal predecessors, (83), 0 states have call successors, (0), 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 17:42:52,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:42:52,612 INFO L93 Difference]: Finished difference Result 1667 states and 3738 transitions. [2022-03-15 17:42:52,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 17:42:52,612 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.608695652173913) internal successors, (83), 22 states have internal predecessors, (83), 0 states have call successors, (0), 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 45 [2022-03-15 17:42:52,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:42:52,615 INFO L225 Difference]: With dead ends: 1667 [2022-03-15 17:42:52,615 INFO L226 Difference]: Without dead ends: 1667 [2022-03-15 17:42:52,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 114 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=412, Invalid=1568, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 17:42:52,615 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 261 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 17:42:52,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [261 Valid, 4 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 17:42:52,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2022-03-15 17:42:52,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1129. [2022-03-15 17:42:52,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 1127 states have (on average 2.3797692990239576) internal successors, (2682), 1128 states have internal predecessors, (2682), 0 states have call successors, (0), 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 17:42:52,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 2682 transitions. [2022-03-15 17:42:52,631 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 2682 transitions. Word has length 45 [2022-03-15 17:42:52,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:42:52,631 INFO L470 AbstractCegarLoop]: Abstraction has 1129 states and 2682 transitions. [2022-03-15 17:42:52,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.608695652173913) internal successors, (83), 22 states have internal predecessors, (83), 0 states have call successors, (0), 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 17:42:52,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 2682 transitions. [2022-03-15 17:42:52,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 17:42:52,632 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:42:52,632 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:42:52,650 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 17:42:52,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:42:52,833 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:42:52,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:42:52,833 INFO L85 PathProgramCache]: Analyzing trace with hash 782682480, now seen corresponding path program 6 times [2022-03-15 17:42:52,844 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:42:52,844 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493439868] [2022-03-15 17:42:52,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:42:52,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:42:52,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:42:52,977 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 17:42:52,977 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:42:52,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493439868] [2022-03-15 17:42:52,977 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493439868] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:42:52,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756534896] [2022-03-15 17:42:52,978 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 17:42:52,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:42:52,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:42:52,979 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 17:42:52,981 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 17:42:53,231 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 17:42:53,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:42:53,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 17:42:53,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:42:53,346 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 17:42:53,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:42:53,520 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 17:42:53,520 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756534896] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:42:53,520 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:42:53,520 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2022-03-15 17:42:53,520 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1418827316] [2022-03-15 17:42:53,520 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:42:53,526 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:42:53,547 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 113 transitions. [2022-03-15 17:42:53,548 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:42:54,070 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [75240#(or (= 400 (+ ~top~0 1)) (<= ~top~0 0) (< 2147483646 ~top~0)), 75241#(or (< (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648) 0) (= ~top~0 399) (< 2147483647 |t1Thread1of1ForFork0_push_#t~ret35#1|) (<= ~top~0 0) (< 2147483646 ~top~0)), 75239#(or (< 2147483646 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (<= |t1Thread1of1ForFork0_inc_top_#t~post31#1| 0) (= 400 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1))), 75242#(or (= 400 ~top~0) (= ~top~0 399) (<= ~top~0 0) (< 2147483646 ~top~0)), 75236#(or (< (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648) 0) (< 2147483647 |t1Thread1of1ForFork0_push_#t~ret35#1|) (<= ~top~0 1)), 75237#(or (< 2147483647 ~top~0) (<= ~top~0 1)), 75238#(or (< 2147483647 ~top~0) (= 400 ~top~0) (<= ~top~0 1))] [2022-03-15 17:42:54,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 17:42:54,071 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:42:54,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 17:42:54,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2022-03-15 17:42:54,072 INFO L87 Difference]: Start difference. First operand 1129 states and 2682 transitions. Second operand has 19 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 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 17:42:54,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:42:54,684 INFO L93 Difference]: Finished difference Result 1707 states and 3836 transitions. [2022-03-15 17:42:54,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 17:42:54,685 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 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 45 [2022-03-15 17:42:54,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:42:54,688 INFO L225 Difference]: With dead ends: 1707 [2022-03-15 17:42:54,688 INFO L226 Difference]: Without dead ends: 1707 [2022-03-15 17:42:54,689 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 107 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=336, Invalid=1224, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 17:42:54,689 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 248 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 17:42:54,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 3 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 17:42:54,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2022-03-15 17:42:54,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1203. [2022-03-15 17:42:54,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 1201 states have (on average 2.4071606994171524) internal successors, (2891), 1202 states have internal predecessors, (2891), 0 states have call successors, (0), 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 17:42:54,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 2891 transitions. [2022-03-15 17:42:54,713 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 2891 transitions. Word has length 45 [2022-03-15 17:42:54,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:42:54,713 INFO L470 AbstractCegarLoop]: Abstraction has 1203 states and 2891 transitions. [2022-03-15 17:42:54,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 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 17:42:54,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 2891 transitions. [2022-03-15 17:42:54,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-15 17:42:54,715 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:42:54,715 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:42:54,747 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 17:42:54,940 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,SelfDestructingSolverStorable26 [2022-03-15 17:42:54,941 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:42:54,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:42:54,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1549347788, now seen corresponding path program 7 times [2022-03-15 17:42:54,943 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:42:54,943 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344406629] [2022-03-15 17:42:54,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:42:54,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:42:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:42:55,116 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 49 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 17:42:55,116 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:42:55,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344406629] [2022-03-15 17:42:55,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344406629] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:42:55,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634683140] [2022-03-15 17:42:55,117 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 17:42:55,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:42:55,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:42:55,128 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 17:42:55,151 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 17:42:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:42:55,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 17:42:55,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:42:55,424 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 17:42:55,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:42:55,570 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 17:42:55,570 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634683140] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:42:55,570 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:42:55,570 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 22 [2022-03-15 17:42:55,570 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1662455800] [2022-03-15 17:42:55,570 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:42:55,577 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:42:55,598 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 85 transitions. [2022-03-15 17:42:55,599 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:42:55,869 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [79666#(or (< (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648) 0) (< 2147483647 |t1Thread1of1ForFork0_push_#t~ret35#1|) (<= ~top~0 0)), 79667#(or (< 2147483647 ~top~0) (<= ~top~0 0)), 79668#(or (< 2147483647 ~top~0) (= 400 ~top~0) (<= ~top~0 0))] [2022-03-15 17:42:55,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 17:42:55,870 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:42:55,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 17:42:55,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2022-03-15 17:42:55,870 INFO L87 Difference]: Start difference. First operand 1203 states and 2891 transitions. Second operand has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 17 states have internal predecessors, (59), 0 states have call successors, (0), 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 17:42:56,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:42:56,401 INFO L93 Difference]: Finished difference Result 1619 states and 3685 transitions. [2022-03-15 17:42:56,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 17:42:56,402 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 17 states have internal predecessors, (59), 0 states have call successors, (0), 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 45 [2022-03-15 17:42:56,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:42:56,405 INFO L225 Difference]: With dead ends: 1619 [2022-03-15 17:42:56,405 INFO L226 Difference]: Without dead ends: 1619 [2022-03-15 17:42:56,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=269, Invalid=853, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 17:42:56,405 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 169 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 17:42:56,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 3 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 17:42:56,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2022-03-15 17:42:56,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1203. [2022-03-15 17:42:56,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 1201 states have (on average 2.4071606994171524) internal successors, (2891), 1202 states have internal predecessors, (2891), 0 states have call successors, (0), 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 17:42:56,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 2891 transitions. [2022-03-15 17:42:56,422 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 2891 transitions. Word has length 45 [2022-03-15 17:42:56,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:42:56,423 INFO L470 AbstractCegarLoop]: Abstraction has 1203 states and 2891 transitions. [2022-03-15 17:42:56,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 17 states have internal predecessors, (59), 0 states have call successors, (0), 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 17:42:56,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 2891 transitions. [2022-03-15 17:42:56,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-03-15 17:42:56,424 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:42:56,424 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2022-03-15 17:42:56,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-03-15 17:42:56,629 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,SelfDestructingSolverStorable27 [2022-03-15 17:42:56,630 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:42:56,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:42:56,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1108616014, now seen corresponding path program 6 times [2022-03-15 17:42:56,631 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:42:56,632 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894792772] [2022-03-15 17:42:56,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:42:56,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:42:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:42:56,820 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 6 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:42:56,821 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:42:56,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894792772] [2022-03-15 17:42:56,821 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894792772] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:42:56,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439123763] [2022-03-15 17:42:56,821 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 17:42:56,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:42:56,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:42:56,823 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 17:42:56,824 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 17:42:57,072 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-03-15 17:42:57,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:42:57,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 17:42:57,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:42:57,196 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 6 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:42:57,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:42:57,437 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 6 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:42:57,437 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439123763] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:42:57,437 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:42:57,437 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 14] total 34 [2022-03-15 17:42:57,437 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [273964844] [2022-03-15 17:42:57,437 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:42:57,445 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:42:57,463 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 48 transitions. [2022-03-15 17:42:57,463 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:42:57,463 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:42:57,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 17:42:57,464 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:42:57,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 17:42:57,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=875, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 17:42:57,464 INFO L87 Difference]: Start difference. First operand 1203 states and 2891 transitions. Second operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 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 17:42:57,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:42:57,956 INFO L93 Difference]: Finished difference Result 1567 states and 3631 transitions. [2022-03-15 17:42:57,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 17:42:57,956 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 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 48 [2022-03-15 17:42:57,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:42:57,960 INFO L225 Difference]: With dead ends: 1567 [2022-03-15 17:42:57,960 INFO L226 Difference]: Without dead ends: 1567 [2022-03-15 17:42:57,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=492, Invalid=1230, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 17:42:57,961 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 238 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 17:42:57,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 4 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 17:42:57,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2022-03-15 17:42:57,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1259. [2022-03-15 17:42:57,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1259 states, 1257 states have (on average 2.4009546539379474) internal successors, (3018), 1258 states have internal predecessors, (3018), 0 states have call successors, (0), 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 17:42:57,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 3018 transitions. [2022-03-15 17:42:57,985 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 3018 transitions. Word has length 48 [2022-03-15 17:42:57,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:42:57,985 INFO L470 AbstractCegarLoop]: Abstraction has 1259 states and 3018 transitions. [2022-03-15 17:42:57,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 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 17:42:57,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 3018 transitions. [2022-03-15 17:42:57,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-03-15 17:42:57,989 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:42:57,989 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:42:58,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-15 17:42:58,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 17:42:58,207 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:42:58,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:42:58,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1852441249, now seen corresponding path program 7 times [2022-03-15 17:42:58,208 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:42:58,208 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128863291] [2022-03-15 17:42:58,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:42:58,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:42:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:42:59,046 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:42:59,047 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:42:59,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128863291] [2022-03-15 17:42:59,047 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128863291] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:42:59,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907850514] [2022-03-15 17:42:59,047 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 17:42:59,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:42:59,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:42:59,049 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 17:42:59,050 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 17:42:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:42:59,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 93 conjunts are in the unsatisfiable core [2022-03-15 17:42:59,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:42:59,570 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 19 treesize of output 15 [2022-03-15 17:43:00,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:43:00,146 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 65 treesize of output 48 [2022-03-15 17:43:00,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:43:00,656 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 65 treesize of output 48 [2022-03-15 17:43:01,924 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 92 treesize of output 56 [2022-03-15 17:44:10,806 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:44:10,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:45:21,796 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_412| Int) (v_ArrVal_1841 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_292| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_292|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_412|) |v_t1Thread1of1ForFork0_push_~stack#1.offset_292|) v_ArrVal_1841)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_412| c_~top~0))) is different from false [2022-03-15 17:45:55,761 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 54 treesize of output 46 [2022-03-15 17:45:55,996 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-15 17:45:55,996 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907850514] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:45:55,996 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:45:55,996 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25, 25] total 78 [2022-03-15 17:45:55,996 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [291575033] [2022-03-15 17:45:55,997 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:45:56,002 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:45:56,032 INFO L252 McrAutomatonBuilder]: Finished intersection with 100 states and 147 transitions. [2022-03-15 17:45:56,032 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:46:03,535 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [88514#(and (or (< (+ ~top~0 2147483648) 0) (= 400 ~top~0) (= ~top~0 399) (< 2147483646 ~top~0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (or (< (+ ~top~0 2147483648) 0) (= 400 ~top~0) (= ~top~0 399) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647) (< 2147483646 ~top~0)) (or (= |~#arr~0.offset| 0) (< (+ ~top~0 2147483648) 0) (= 400 ~top~0) (= ~top~0 399) (< 2147483646 ~top~0))), 88510#(and (or (< (+ 2147483649 ~top~0) 0) (= 400 (+ ~top~0 1)) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647) (< 2147483646 ~top~0)) (or (< (+ 2147483649 ~top~0) 0) (= 400 (+ ~top~0 1)) (< 2147483646 ~top~0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (or (= |~#arr~0.offset| 0) (< (+ 2147483649 ~top~0) 0) (= 400 (+ ~top~0 1)) (< 2147483646 ~top~0))), 88511#(and (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (< (+ 2147483649 ~top~0) 0) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (+ (* ~top~0 4) (- 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))) (<= 0 |t1Thread1of1ForFork0_push_~x#1|)) (= 400 (+ ~top~0 1)) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (and (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (+ (* ~top~0 4) (- 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (< 2147483646 ~top~0)) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (and (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (+ (* ~top~0 4) (- 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))))) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647)) (< (+ 2147483649 ~top~0) 0) (= 400 (+ ~top~0 1)) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (+ (* ~top~0 4) (- 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647)) (< 2147483646 ~top~0)) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (= |~#arr~0.offset| 0) (< (+ 2147483649 ~top~0) 0) (= 400 (+ ~top~0 1)) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (< 2147483646 ~top~0))), 88507#(and (or (not (<= 0 (+ ~top~0 2147483648))) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647)) (= 400 ~top~0)) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8)))) (= 400 ~top~0) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ (* ~top~0 4) (- 8)))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8)))) (= 400 ~top~0) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (= 400 ~top~0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 2147483647) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ (* ~top~0 4) (- 8)))) (or (not (<= 0 (+ ~top~0 2147483648))) (<= 0 |t1Thread1of1ForFork0_push_#in~x#1|) (not (<= ~top~0 2147483647)) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ (* ~top~0 4) (- 8)))) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (= 400 ~top~0)) (or (not (<= 0 (+ ~top~0 2147483648))) (<= |t1Thread1of1ForFork0_push_#in~x#1| 2147483647) (not (<= ~top~0 2147483647)) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ (* ~top~0 4) (- 8)))) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (= 400 ~top~0)) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (= 400 ~top~0) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 2147483647))), 88505#(and (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (= |~#arr~0.offset| 0) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648)))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (and (= (+ (* ~top~0 4) (- 8)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647)) (and (not (and (= (+ (* ~top~0 4) (- 8)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|))) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 2147483647)) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648)))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (and (= (+ (* ~top~0 4) (- 8)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|)) (and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8)))) (not (and (= (+ (* ~top~0 4) (- 8)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)))))), 88519#(and (or (<= 0 |t1Thread1of1ForFork0_push_#in~x#1|) (< (+ ~top~0 2147483648) 0) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (= 400 ~top~0) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.offset| 0)) (= ~top~0 399) (< 2147483645 ~top~0) (= ~top~0 398)) (or (< (+ ~top~0 2147483648) 0) (= 400 ~top~0) (= ~top~0 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (< 2147483645 ~top~0) (= ~top~0 398)) (or (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 2147483647) (< (+ ~top~0 2147483648) 0) (= 400 ~top~0) (= ~top~0 399) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (< 2147483645 ~top~0) (= ~top~0 398)) (or (= |~#arr~0.offset| 0) (< (+ ~top~0 2147483648) 0) (= 400 ~top~0) (= ~top~0 399) (< 2147483645 ~top~0) (= ~top~0 398)) (or (< (+ ~top~0 2147483648) 0) (= |t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (= 400 ~top~0) (= ~top~0 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (< 2147483645 ~top~0) (= ~top~0 398)) (or (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 2147483647) (< (+ ~top~0 2147483648) 0) (= |t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (= 400 ~top~0) (= ~top~0 399) (< 2147483645 ~top~0) (= ~top~0 398)) (or (<= |t1Thread1of1ForFork0_push_#in~x#1| 2147483647) (< (+ ~top~0 2147483648) 0) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (= 400 ~top~0) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.offset| 0)) (= ~top~0 399) (< 2147483645 ~top~0) (= ~top~0 398))), 88513#(and (or (<= |t1Thread1of1ForFork0_push_#in~x#1| 2147483647) (< (+ ~top~0 2147483648) 0) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (= 400 ~top~0) (= ~top~0 399) (not (= (+ |t1Thread1of1ForFork0_push_#in~stack#1.offset| 4) 0)) (< 2147483646 ~top~0)) (or (< (+ ~top~0 2147483648) 0) (= 400 ~top~0) (= ~top~0 399) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647) (< 2147483646 ~top~0)) (or (< (+ ~top~0 2147483648) 0) (= 400 ~top~0) (= ~top~0 399) (= (+ |t1Thread1of1ForFork0_push_#in~stack#1.offset| 4) 0) (< 2147483646 ~top~0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (or (< (+ ~top~0 2147483648) 0) (= 400 ~top~0) (= ~top~0 399) (= (+ |t1Thread1of1ForFork0_push_#in~stack#1.offset| 4) 0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647) (< 2147483646 ~top~0)) (or (= |~#arr~0.offset| 0) (< (+ ~top~0 2147483648) 0) (= 400 ~top~0) (= ~top~0 399) (< 2147483646 ~top~0)) (or (<= 0 |t1Thread1of1ForFork0_push_#in~x#1|) (< (+ ~top~0 2147483648) 0) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (= 400 ~top~0) (= ~top~0 399) (not (= (+ |t1Thread1of1ForFork0_push_#in~stack#1.offset| 4) 0)) (< 2147483646 ~top~0)) (or (< (+ ~top~0 2147483648) 0) (= 400 ~top~0) (= ~top~0 399) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (< 2147483646 ~top~0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4)))))), 88518#(and (or (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (< (+ ~top~0 2147483648) 0) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647) (= ~top~0 399) (< 2147483645 ~top~0) (= ~top~0 398) (not (= |t1Thread1of1ForFork0_push_~stack#1.offset| 0))) (or (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (< (+ ~top~0 2147483648) 0) (= ~top~0 399) (< 2147483645 ~top~0) (= ~top~0 398) (not (= |t1Thread1of1ForFork0_push_~stack#1.offset| 0))) (or (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 2147483647) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (< (+ ~top~0 2147483648) 0) (= ~top~0 399) (< 2147483645 ~top~0) (= ~top~0 398)) (or (< (+ ~top~0 2147483648) 0) (= ~top~0 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (= |t1Thread1of1ForFork0_push_~stack#1.offset| 0) (< 2147483645 ~top~0) (= ~top~0 398)) (or (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 2147483647) (< (+ ~top~0 2147483648) 0) (= ~top~0 399) (= |t1Thread1of1ForFork0_push_~stack#1.offset| 0) (< 2147483645 ~top~0) (= ~top~0 398)) (or (= |~#arr~0.offset| 0) (< (+ ~top~0 2147483648) 0) (= ~top~0 399) (< 2147483645 ~top~0) (= ~top~0 398)) (or (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (< (+ ~top~0 2147483648) 0) (= ~top~0 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (< 2147483645 ~top~0) (= ~top~0 398))), 88508#(and (or (< 2147483647 ~top~0) (< (+ ~top~0 2147483648) 0) (= 400 ~top~0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 2147483647)) (or (< 2147483647 ~top~0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8)))) (< (+ ~top~0 2147483648) 0) (= 400 ~top~0)) (or (< 2147483647 ~top~0) (= |~#arr~0.offset| 0) (< (+ ~top~0 2147483648) 0) (= 400 ~top~0))), 88506#(and (or (not (<= 0 (+ ~top~0 2147483648))) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (not (= (+ (* ~top~0 4) (- 8)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (not (<= ~top~0 2147483647))) (or (not (<= 0 (+ ~top~0 2147483648))) (= (+ (* ~top~0 4) (- 8)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)) (not (<= ~top~0 2147483647)) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 2147483647)) (or (not (<= 0 (+ ~top~0 2147483648))) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (not (= (+ (* ~top~0 4) (- 8)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (not (<= ~top~0 2147483647)) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647)) (or (not (<= 0 (+ ~top~0 2147483648))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (<= ~top~0 2147483647)) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 2147483647)) (or (not (<= 0 (+ ~top~0 2147483648))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (<= ~top~0 2147483647)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))))) (or (not (<= 0 (+ ~top~0 2147483648))) (= (+ (* ~top~0 4) (- 8)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)) (not (<= ~top~0 2147483647)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8)))))), 88520#(or (= |~#arr~0.offset| 0) (< (+ ~top~0 2147483648) 0) (= 400 ~top~0) (= ~top~0 399) (< 2147483645 ~top~0) (= ~top~0 398)), 88509#(and (or (= |~#arr~0.offset| 0) (< 2147483646 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (< (+ 2147483649 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) 0) (= 400 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1))) (or (< 2147483646 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (< (+ 2147483649 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) 0) (= 400 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1)) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (- 4) (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4))) 2147483647)) (or (< 2147483646 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (- 4) (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4)))) (< (+ 2147483649 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) 0) (= 400 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1)))), 88512#(and (or (not (= (+ |t1Thread1of1ForFork0_push_~stack#1.offset| 4) 0)) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (< (+ ~top~0 2147483648) 0) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647) (= ~top~0 399) (< 2147483646 ~top~0)) (or (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (< (+ ~top~0 2147483648) 0) (= ~top~0 399) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647) (< 2147483646 ~top~0)) (or (not (= (+ |t1Thread1of1ForFork0_push_~stack#1.offset| 4) 0)) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (< (+ ~top~0 2147483648) 0) (= ~top~0 399) (< 2147483646 ~top~0)) (or (= (+ |t1Thread1of1ForFork0_push_~stack#1.offset| 4) 0) (< (+ ~top~0 2147483648) 0) (= ~top~0 399) (< 2147483646 ~top~0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (or (= |~#arr~0.offset| 0) (< (+ ~top~0 2147483648) 0) (= ~top~0 399) (< 2147483646 ~top~0)) (or (= (+ |t1Thread1of1ForFork0_push_~stack#1.offset| 4) 0) (< (+ ~top~0 2147483648) 0) (= ~top~0 399) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 2147483647) (< 2147483646 ~top~0)) (or (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (< (+ ~top~0 2147483648) 0) (= ~top~0 399) (< 2147483646 ~top~0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4)))))), 88516#(and (or (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 2147483647) (< (+ 2147483649 ~top~0) 0) (= 400 (+ ~top~0 1)) (< 2147483645 ~top~0) (= 399 (+ ~top~0 1))) (or (< (+ 2147483649 ~top~0) 0) (= 400 (+ ~top~0 1)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (< 2147483645 ~top~0) (= 399 (+ ~top~0 1))) (or (= |~#arr~0.offset| 0) (< (+ 2147483649 ~top~0) 0) (= 400 (+ ~top~0 1)) (< 2147483645 ~top~0) (= 399 (+ ~top~0 1)))), 88515#(and (or (<= (select (select |#memory_int| |~#arr~0.base|) (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4)) 2147483647) (= 399 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1)) (< 2147483645 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (< (+ 2147483649 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) 0) (= 400 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1))) (or (= |~#arr~0.offset| 0) (= 399 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1)) (< 2147483645 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (< (+ 2147483649 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) 0) (= 400 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1))) (or (= 399 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1)) (< 2147483645 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4))) (< (+ 2147483649 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) 0) (= 400 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1)))), 88517#(and (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (< (+ 2147483649 ~top~0) 0) (= 400 (+ ~top~0 1)) (< 2147483645 ~top~0) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (= (* ~top~0 4) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)))) (= 399 (+ ~top~0 1)) (and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (* ~top~0 4) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))))))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (= |~#arr~0.offset| 0) (< (+ 2147483649 ~top~0) 0) (= 400 (+ ~top~0 1)) (< 2147483645 ~top~0) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (= 399 (+ ~top~0 1))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (< (+ 2147483649 ~top~0) 0) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (* ~top~0 4) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))) (<= |t1Thread1of1ForFork0_push_~x#1| 2147483647)) (= 400 (+ ~top~0 1)) (and (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 2147483647) (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (* ~top~0 4) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)))))) (< 2147483645 ~top~0) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (= 399 (+ ~top~0 1))))] [2022-03-15 17:46:03,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-15 17:46:03,536 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:46:03,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-15 17:46:03,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=8267, Unknown=57, NotChecked=184, Total=8930 [2022-03-15 17:46:03,536 INFO L87 Difference]: Start difference. First operand 1259 states and 3018 transitions. Second operand has 46 states, 45 states have (on average 2.422222222222222) internal successors, (109), 45 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:46:53,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:46:53,398 INFO L93 Difference]: Finished difference Result 5796 states and 13214 transitions. [2022-03-15 17:46:53,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2022-03-15 17:46:53,399 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.422222222222222) internal successors, (109), 45 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-03-15 17:46:53,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:46:53,407 INFO L225 Difference]: With dead ends: 5796 [2022-03-15 17:46:53,408 INFO L226 Difference]: Without dead ends: 5796 [2022-03-15 17:46:53,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 82 SyntacticMatches, 6 SemanticMatches, 229 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 16951 ImplicationChecksByTransitivity, 220.9s TimeCoverageRelationStatistics Valid=4137, Invalid=48480, Unknown=57, NotChecked=456, Total=53130 [2022-03-15 17:46:53,411 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1099 mSDsluCounter, 5127 mSDsCounter, 0 mSdLazyCounter, 11919 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 12149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 11919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-03-15 17:46:53,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1099 Valid, 0 Invalid, 12149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 11919 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2022-03-15 17:46:53,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5796 states. [2022-03-15 17:46:53,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5796 to 3104. [2022-03-15 17:46:53,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3104 states, 3102 states have (on average 2.5399742101869762) internal successors, (7879), 3103 states have internal predecessors, (7879), 0 states have call successors, (0), 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 17:46:53,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 7879 transitions. [2022-03-15 17:46:53,494 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 7879 transitions. Word has length 51 [2022-03-15 17:46:53,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:46:53,494 INFO L470 AbstractCegarLoop]: Abstraction has 3104 states and 7879 transitions. [2022-03-15 17:46:53,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.422222222222222) internal successors, (109), 45 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:46:53,495 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 7879 transitions. [2022-03-15 17:46:53,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-03-15 17:46:53,498 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:46:53,499 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:46:53,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-03-15 17:46:53,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:46:53,712 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-15 17:46:53,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:46:53,712 INFO L85 PathProgramCache]: Analyzing trace with hash -832421569, now seen corresponding path program 8 times [2022-03-15 17:46:53,714 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:46:53,714 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222284013] [2022-03-15 17:46:53,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:46:53,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:46:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:46:54,471 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:46:54,471 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:46:54,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222284013] [2022-03-15 17:46:54,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222284013] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 17:46:54,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689759642] [2022-03-15 17:46:54,471 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 17:46:54,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:46:54,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:46:54,473 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 17:46:54,473 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 17:46:54,650 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 17:46:54,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 17:46:54,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 101 conjunts are in the unsatisfiable core [2022-03-15 17:46:54,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 17:46:54,678 INFO L353 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-03-15 17:46:54,678 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 29 treesize of output 34 [2022-03-15 17:46:55,023 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 19 treesize of output 15 [2022-03-15 17:46:55,124 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 76 treesize of output 70 [2022-03-15 17:46:55,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:46:55,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 65 treesize of output 48 [2022-03-15 17:46:56,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 17:46:56,222 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 48 [2022-03-15 17:46:57,519 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 92 treesize of output 56 [2022-03-15 17:46:57,840 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:46:57,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 17:47:15,135 WARN L838 $PredicateComparison]: unable to prove that (or (= (+ c_~top~0 1) 0) (forall ((v_ArrVal_1932 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1932) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296))))) is different from false [2022-03-15 17:47:15,143 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:47:15,144 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 29 treesize of output 30 [2022-03-15 17:47:15,151 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 17:47:15,152 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 49 treesize of output 52 [2022-03-15 17:47:15,155 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 28 treesize of output 22 [2022-03-15 17:47:15,501 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:47:15,502 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689759642] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 17:47:15,502 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 17:47:15,502 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2022-03-15 17:47:15,502 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [294117935] [2022-03-15 17:47:15,502 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:47:15,507 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:47:15,536 INFO L252 McrAutomatonBuilder]: Finished intersection with 92 states and 131 transitions. [2022-03-15 17:47:15,536 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:47:20,038 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [101178#(and (or (not (<= 0 (+ ~top~0 2147483648))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 399) (not (<= ~top~0 2147483647))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (not (= (+ (* ~top~0 4) (- 8)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (not (<= ~top~0 2147483647))) (or (not (<= 0 (+ ~top~0 2147483648))) (= (+ (* ~top~0 4) (- 8)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 399) (not (<= ~top~0 2147483647))) (or (not (<= 0 (+ ~top~0 2147483648))) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (not (= (+ (* ~top~0 4) (- 8)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|))) (not (<= ~top~0 2147483647)) (<= |t1Thread1of1ForFork0_push_~x#1| 399)) (or (not (<= 0 (+ ~top~0 2147483648))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (not (<= ~top~0 2147483647)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))))) (or (not (<= 0 (+ ~top~0 2147483648))) (= (+ (* ~top~0 4) (- 8)) (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_~stack#1.offset|)) (not (<= ~top~0 2147483647)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8)))))), 101188#(and (or (< (+ 2147483649 ~top~0) 0) (= 400 (+ ~top~0 1)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (< 2147483645 ~top~0) (= 399 (+ ~top~0 1))) (or (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 399) (< (+ 2147483649 ~top~0) 0) (= 400 (+ ~top~0 1)) (< 2147483645 ~top~0) (= 399 (+ ~top~0 1))) (or (= |~#arr~0.offset| 0) (< (+ 2147483649 ~top~0) 0) (= 400 (+ ~top~0 1)) (< 2147483645 ~top~0) (= 399 (+ ~top~0 1)))), 101184#(and (or (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (< (+ ~top~0 2147483648) 0) (= ~top~0 399) (< 2147483646 ~top~0)) (or (not (= (+ |t1Thread1of1ForFork0_push_~stack#1.offset| 4) 0)) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (<= 0 |t1Thread1of1ForFork0_push_~x#1|) (< (+ ~top~0 2147483648) 0) (= ~top~0 399) (< 2147483646 ~top~0)) (or (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (= (+ |t1Thread1of1ForFork0_push_~stack#1.offset| 4) 0) (< (+ ~top~0 2147483648) 0) (= ~top~0 399) (< 2147483646 ~top~0)) (or (= (+ |t1Thread1of1ForFork0_push_~stack#1.offset| 4) 0) (< (+ ~top~0 2147483648) 0) (= ~top~0 399) (< 2147483646 ~top~0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (or (not (= (+ |t1Thread1of1ForFork0_push_~stack#1.offset| 4) 0)) (not (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)) (<= |t1Thread1of1ForFork0_push_~x#1| 399) (< (+ ~top~0 2147483648) 0) (= ~top~0 399) (< 2147483646 ~top~0)) (or (= |~#arr~0.offset| 0) (< (+ ~top~0 2147483648) 0) (= ~top~0 399) (< 2147483646 ~top~0)) (or (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (< (+ ~top~0 2147483648) 0) (= ~top~0 399) (< 2147483646 ~top~0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4)))))), 101177#(and (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (= |~#arr~0.offset| 0) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648)))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 399) (not (and (= (+ (* ~top~0 4) (- 8)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)))) (and (= (+ (* ~top~0 4) (- 8)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= |t1Thread1of1ForFork0_push_~x#1| 399)) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648)))) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (and (= (+ (* ~top~0 4) (- 8)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (<= 0 |t1Thread1of1ForFork0_push_~x#1|)) (and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8)))) (not (and (= (+ (* ~top~0 4) (- 8)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))) (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|)))))), 101181#(and (or (< 2147483646 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (- 4) (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4))) 399) (< (+ 2147483649 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) 0) (= 400 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1))) (or (= |~#arr~0.offset| 0) (< 2147483646 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (< (+ 2147483649 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) 0) (= 400 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1))) (or (< 2147483646 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (- 4) (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4)))) (< (+ 2147483649 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) 0) (= 400 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1)))), 101183#(and (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (< (+ 2147483649 ~top~0) 0) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (+ (* ~top~0 4) (- 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))) (<= 0 |t1Thread1of1ForFork0_push_~x#1|)) (= 400 (+ ~top~0 1)) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (and (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (+ (* ~top~0 4) (- 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))))) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (< 2147483646 ~top~0)) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (< (+ 2147483649 ~top~0) 0) (= 400 (+ ~top~0 1)) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (+ (* ~top~0 4) (- 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4))) (<= |t1Thread1of1ForFork0_push_~x#1| 399)) (and (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (not (and (= |t1Thread1of1ForFork0_push_~stack#1.base| |~#arr~0.base|) (= (+ (* ~top~0 4) (- 4)) (+ |t1Thread1of1ForFork0_push_~stack#1.offset| (* |t1Thread1of1ForFork0_push_#t~ret35#1| 4)))))) (< 2147483646 ~top~0)) (or (not (<= |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483647)) (= |~#arr~0.offset| 0) (< (+ 2147483649 ~top~0) 0) (= 400 (+ ~top~0 1)) (not (<= 0 (+ |t1Thread1of1ForFork0_push_#t~ret35#1| 2147483648))) (< 2147483646 ~top~0))), 101186#(and (or (< (+ ~top~0 2147483648) 0) (= 400 ~top~0) (= ~top~0 399) (< 2147483646 ~top~0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (or (= |~#arr~0.offset| 0) (< (+ ~top~0 2147483648) 0) (= 400 ~top~0) (= ~top~0 399) (< 2147483646 ~top~0)) (or (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (< (+ ~top~0 2147483648) 0) (= 400 ~top~0) (= ~top~0 399) (< 2147483646 ~top~0))), 101179#(and (or (not (<= 0 (+ ~top~0 2147483648))) (= |~#arr~0.offset| 0) (not (<= ~top~0 2147483647)) (= 400 ~top~0)) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8)))) (= 400 ~top~0) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ (* ~top~0 4) (- 8)))) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8)))) (= 400 ~top~0) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (or (not (<= 0 (+ ~top~0 2147483648))) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 399) (not (<= ~top~0 2147483647)) (= 400 ~top~0) (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ (* ~top~0 4) (- 8)))) (or (not (<= 0 (+ ~top~0 2147483648))) (<= 0 |t1Thread1of1ForFork0_push_#in~x#1|) (not (<= ~top~0 2147483647)) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ (* ~top~0 4) (- 8)))) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (= 400 ~top~0)) (or (not (<= 0 (+ ~top~0 2147483648))) (not (<= ~top~0 2147483647)) (not (= (+ (* ~top~0 4) |t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ (* ~top~0 4) (- 8)))) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (<= |t1Thread1of1ForFork0_push_#in~x#1| 399) (= 400 ~top~0)) (or (not (<= 0 (+ ~top~0 2147483648))) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 399) (not (<= ~top~0 2147483647)) (= 400 ~top~0) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|))), 101180#(and (or (< 2147483647 ~top~0) (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8))) 399) (< (+ ~top~0 2147483648) 0) (= 400 ~top~0)) (or (< 2147483647 ~top~0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 8)))) (< (+ ~top~0 2147483648) 0) (= 400 ~top~0)) (or (< 2147483647 ~top~0) (= |~#arr~0.offset| 0) (< (+ ~top~0 2147483648) 0) (= 400 ~top~0))), 101182#(and (or (< (+ 2147483649 ~top~0) 0) (= 400 (+ ~top~0 1)) (< 2147483646 ~top~0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (or (= |~#arr~0.offset| 0) (< (+ 2147483649 ~top~0) 0) (= 400 (+ ~top~0 1)) (< 2147483646 ~top~0)) (or (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (< (+ 2147483649 ~top~0) 0) (= 400 (+ ~top~0 1)) (< 2147483646 ~top~0))), 101185#(and (or (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (< (+ ~top~0 2147483648) 0) (= 400 ~top~0) (= ~top~0 399) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (< 2147483646 ~top~0)) (or (< (+ ~top~0 2147483648) 0) (= 400 ~top~0) (= ~top~0 399) (= (+ |t1Thread1of1ForFork0_push_#in~stack#1.offset| 4) 0) (< 2147483646 ~top~0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))))) (or (= |~#arr~0.offset| 0) (< (+ ~top~0 2147483648) 0) (= 400 ~top~0) (= ~top~0 399) (< 2147483646 ~top~0)) (or (< (+ ~top~0 2147483648) 0) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (<= |t1Thread1of1ForFork0_push_#in~x#1| 399) (= 400 ~top~0) (= ~top~0 399) (not (= (+ |t1Thread1of1ForFork0_push_#in~stack#1.offset| 4) 0)) (< 2147483646 ~top~0)) (or (<= 0 |t1Thread1of1ForFork0_push_#in~x#1|) (< (+ ~top~0 2147483648) 0) (not (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|)) (= 400 ~top~0) (= ~top~0 399) (not (= (+ |t1Thread1of1ForFork0_push_#in~stack#1.offset| 4) 0)) (< 2147483646 ~top~0)) (or (<= (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4))) 399) (< (+ ~top~0 2147483648) 0) (= 400 ~top~0) (= ~top~0 399) (= (+ |t1Thread1of1ForFork0_push_#in~stack#1.offset| 4) 0) (< 2147483646 ~top~0)) (or (< (+ ~top~0 2147483648) 0) (= 400 ~top~0) (= ~top~0 399) (= |t1Thread1of1ForFork0_push_#in~stack#1.base| |~#arr~0.base|) (< 2147483646 ~top~0) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (+ (* ~top~0 4) (- 4)))))), 101187#(and (or (= 399 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1)) (< 2147483645 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (<= (select (select |#memory_int| |~#arr~0.base|) (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4)) 399) (< (+ 2147483649 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) 0) (= 400 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1))) (or (= |~#arr~0.offset| 0) (= 399 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1)) (< 2147483645 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (< (+ 2147483649 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) 0) (= 400 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1))) (or (= 399 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1)) (< 2147483645 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* |t1Thread1of1ForFork0_inc_top_#t~post31#1| 4))) (< (+ 2147483649 |t1Thread1of1ForFork0_inc_top_#t~post31#1|) 0) (= 400 (+ |t1Thread1of1ForFork0_inc_top_#t~post31#1| 1))))] [2022-03-15 17:47:20,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 17:47:20,038 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:47:20,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 17:47:20,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=471, Invalid=7718, Unknown=5, NotChecked=178, Total=8372 [2022-03-15 17:47:20,039 INFO L87 Difference]: Start difference. First operand 3104 states and 7879 transitions. Second operand has 40 states, 39 states have (on average 2.3846153846153846) internal successors, (93), 39 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-03-15 17:47:35,991 WARN L244 SmtUtils]: Removed 14 from assertion stack [2022-03-15 17:47:35,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-03-15 17:47:35,993 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 17:47:35,995 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 181 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10671 ImplicationChecksByTransitivity, 33.5s TimeCoverageRelationStatistics Valid=3151, Invalid=29790, Unknown=5, NotChecked=360, Total=33306 [2022-03-15 17:47:35,995 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1231 mSDsluCounter, 2019 mSDsCounter, 0 mSdLazyCounter, 4464 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1231 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 4464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-03-15 17:47:35,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1231 Valid, 0 Invalid, 4750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 4464 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-03-15 17:47:35,996 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-03-15 17:47:36,011 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 17:47:36,015 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 17:47:36,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 17:47:36,197 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (3104states) and FLOYD_HOARE automaton (currently 99 states, 40 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 87 for 199ms.. [2022-03-15 17:47:36,199 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 6 remaining) [2022-03-15 17:47:36,199 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 6 remaining) [2022-03-15 17:47:36,199 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-03-15 17:47:36,199 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-03-15 17:47:36,199 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-03-15 17:47:36,201 INFO L732 BasicCegarLoop]: Path program histogram: [8, 7, 6, 6, 1, 1, 1, 1] [2022-03-15 17:47:36,204 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 17:47:36,204 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 17:47:36,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 05:47:36 BasicIcfg [2022-03-15 17:47:36,206 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 17:47:36,206 INFO L158 Benchmark]: Toolchain (without parser) took 826493.85ms. Allocated memory was 184.5MB in the beginning and 382.7MB in the end (delta: 198.2MB). Free memory was 156.6MB in the beginning and 265.4MB in the end (delta: -108.7MB). Peak memory consumption was 289.2MB. Max. memory is 8.0GB. [2022-03-15 17:47:36,206 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 184.5MB. Free memory is still 145.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 17:47:36,206 INFO L158 Benchmark]: CACSL2BoogieTranslator took 618.09ms. Allocated memory was 184.5MB in the beginning and 265.3MB in the end (delta: 80.7MB). Free memory was 156.3MB in the beginning and 217.8MB in the end (delta: -61.5MB). Peak memory consumption was 20.2MB. Max. memory is 8.0GB. [2022-03-15 17:47:36,207 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.72ms. Allocated memory is still 265.3MB. Free memory was 217.8MB in the beginning and 214.8MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 17:47:36,207 INFO L158 Benchmark]: Boogie Preprocessor took 42.94ms. Allocated memory is still 265.3MB. Free memory was 214.8MB in the beginning and 213.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 17:47:36,207 INFO L158 Benchmark]: RCFGBuilder took 387.33ms. Allocated memory is still 265.3MB. Free memory was 213.1MB in the beginning and 197.7MB in the end (delta: 15.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-03-15 17:47:36,207 INFO L158 Benchmark]: TraceAbstraction took 825368.93ms. Allocated memory was 265.3MB in the beginning and 382.7MB in the end (delta: 117.4MB). Free memory was 197.0MB in the beginning and 265.4MB in the end (delta: -68.4MB). Peak memory consumption was 248.1MB. Max. memory is 8.0GB. [2022-03-15 17:47:36,208 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.11ms. Allocated memory is still 184.5MB. Free memory is still 145.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 618.09ms. Allocated memory was 184.5MB in the beginning and 265.3MB in the end (delta: 80.7MB). Free memory was 156.3MB in the beginning and 217.8MB in the end (delta: -61.5MB). Peak memory consumption was 20.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 71.72ms. Allocated memory is still 265.3MB. Free memory was 217.8MB in the beginning and 214.8MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.94ms. Allocated memory is still 265.3MB. Free memory was 214.8MB in the beginning and 213.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 387.33ms. Allocated memory is still 265.3MB. Free memory was 213.1MB in the beginning and 197.7MB in the end (delta: 15.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 825368.93ms. Allocated memory was 265.3MB in the beginning and 382.7MB in the end (delta: 117.4MB). Free memory was 197.0MB in the beginning and 265.4MB in the end (delta: -68.4MB). Peak memory consumption was 248.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 169 PlacesBefore, 39 PlacesAfterwards, 172 TransitionsBefore, 37 TransitionsAfterwards, 8324 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 97 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 24 ConcurrentYvCompositions, 5 ChoiceCompositions, 165 TotalNumberOfCompositions, 11337 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9084, positive: 8899, positive conditional: 0, positive unconditional: 8899, negative: 185, negative conditional: 0, negative unconditional: 185, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4852, positive: 4789, positive conditional: 0, positive unconditional: 4789, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9084, positive: 4110, positive conditional: 0, positive unconditional: 4110, negative: 122, negative conditional: 0, negative unconditional: 122, unknown: 4852, unknown conditional: 0, unknown unconditional: 4852] , Statistics on independence cache: Total cache size (in pairs): 185, Positive cache size: 168, Positive conditional cache size: 0, Positive unconditional cache size: 168, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - 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: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (3104states) and FLOYD_HOARE automaton (currently 99 states, 40 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 87 for 199ms.. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (3104states) and FLOYD_HOARE automaton (currently 99 states, 40 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 87 for 199ms.. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (3104states) and FLOYD_HOARE automaton (currently 99 states, 40 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 87 for 199ms.. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (3104states) and FLOYD_HOARE automaton (currently 99 states, 40 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 87 for 199ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 272 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 825.1s, OverallIterations: 31, TraceHistogramMax: 7, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.1s, AutomataDifference: 190.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9778 SdHoareTripleChecker+Valid, 35.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9778 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 31.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19216 mSDsCounter, 1967 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43105 IncrementalHoareTripleChecker+Invalid, 45072 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1967 mSolverCounterUnsat, 22 mSDtfsCounter, 43105 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3447 GetRequests, 1600 SyntacticMatches, 85 SemanticMatches, 1761 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 59199 ImplicationChecksByTransitivity, 725.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3104occurred in iteration=30, InterpolantAutomatonStates: 804, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 30 MinimizatonAttempts, 13615 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 581.5s InterpolantComputationTime, 1891 NumberOfCodeBlocks, 1856 NumberOfCodeBlocksAsserted, 93 NumberOfCheckSat, 2638 ConstructedInterpolants, 61 QuantifiedInterpolants, 54362 SizeOfPredicates, 430 NumberOfNonLiveVariables, 8045 ConjunctsInSsa, 1016 ConjunctsInUnsatCore, 77 InterpolantComputations, 9 PerfectInterpolantSequences, 408/2446 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