/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 19:43:23,748 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 19:43:23,750 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 19:43:23,789 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 19:43:23,789 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 19:43:23,790 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 19:43:23,792 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 19:43:23,793 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 19:43:23,811 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 19:43:23,813 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 19:43:23,814 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 19:43:23,815 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 19:43:23,815 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 19:43:23,816 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 19:43:23,817 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 19:43:23,817 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 19:43:23,818 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 19:43:23,819 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 19:43:23,820 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 19:43:23,822 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 19:43:23,823 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 19:43:23,828 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 19:43:23,829 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 19:43:23,830 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 19:43:23,832 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 19:43:23,832 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 19:43:23,833 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 19:43:23,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 19:43:23,834 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 19:43:23,834 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 19:43:23,835 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 19:43:23,835 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 19:43:23,836 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 19:43:23,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 19:43:23,837 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 19:43:23,837 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 19:43:23,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 19:43:23,838 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 19:43:23,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 19:43:23,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 19:43:23,840 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 19:43:23,848 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 19:43:23,878 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 19:43:23,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 19:43:23,886 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 19:43:23,886 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 19:43:23,887 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 19:43:23,887 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 19:43:23,887 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 19:43:23,887 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 19:43:23,887 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 19:43:23,887 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 19:43:23,888 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 19:43:23,888 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 19:43:23,889 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 19:43:23,889 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 19:43:23,889 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 19:43:23,889 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 19:43:23,889 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 19:43:23,889 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 19:43:23,889 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 19:43:23,890 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 19:43:23,890 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 19:43:23,890 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 19:43:23,890 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 19:43:23,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:43:23,891 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 19:43:23,891 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 19:43:23,891 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 19:43:23,891 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 19:43:23,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 19:43:23,891 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 19:43:23,891 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 19:43:23,891 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 19:43:23,892 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 19:43:24,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 19:43:24,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 19:43:24,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 19:43:24,150 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 19:43:24,152 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 19:43:24,152 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c [2022-03-15 19:43:24,207 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a75a1edb5/c9317a48960d4a798278ccb8a9973d17/FLAG9129e1550 [2022-03-15 19:43:24,668 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 19:43:24,669 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c [2022-03-15 19:43:24,679 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a75a1edb5/c9317a48960d4a798278ccb8a9973d17/FLAG9129e1550 [2022-03-15 19:43:24,696 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a75a1edb5/c9317a48960d4a798278ccb8a9973d17 [2022-03-15 19:43:24,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 19:43:24,700 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 19:43:24,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 19:43:24,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 19:43:24,704 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 19:43:24,705 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:43:24" (1/1) ... [2022-03-15 19:43:24,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69b176e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:24, skipping insertion in model container [2022-03-15 19:43:24,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:43:24" (1/1) ... [2022-03-15 19:43:24,712 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 19:43:24,730 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 19:43:24,957 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c[2696,2709] [2022-03-15 19:43:24,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:43:24,977 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 19:43:25,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c[2696,2709] [2022-03-15 19:43:25,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:43:25,032 INFO L208 MainTranslator]: Completed translation [2022-03-15 19:43:25,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:25 WrapperNode [2022-03-15 19:43:25,033 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 19:43:25,034 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 19:43:25,035 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 19:43:25,035 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 19:43:25,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:25" (1/1) ... [2022-03-15 19:43:25,055 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:25" (1/1) ... [2022-03-15 19:43:25,085 INFO L137 Inliner]: procedures = 24, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 154 [2022-03-15 19:43:25,086 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 19:43:25,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 19:43:25,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 19:43:25,087 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 19:43:25,094 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:25" (1/1) ... [2022-03-15 19:43:25,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:25" (1/1) ... [2022-03-15 19:43:25,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:25" (1/1) ... [2022-03-15 19:43:25,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:25" (1/1) ... [2022-03-15 19:43:25,114 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:25" (1/1) ... [2022-03-15 19:43:25,117 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:25" (1/1) ... [2022-03-15 19:43:25,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:25" (1/1) ... [2022-03-15 19:43:25,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 19:43:25,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 19:43:25,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 19:43:25,132 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 19:43:25,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:25" (1/1) ... [2022-03-15 19:43:25,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:43:25,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:25,177 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 19:43:25,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 19:43:25,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 19:43:25,228 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 19:43:25,229 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 19:43:25,229 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 19:43:25,229 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 19:43:25,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 19:43:25,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 19:43:25,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 19:43:25,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 19:43:25,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 19:43:25,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 19:43:25,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 19:43:25,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 19:43:25,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 19:43:25,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 19:43:25,233 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 19:43:25,320 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 19:43:25,322 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 19:43:25,588 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 19:43:25,706 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 19:43:25,707 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-15 19:43:25,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:43:25 BoogieIcfgContainer [2022-03-15 19:43:25,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 19:43:25,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 19:43:25,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 19:43:25,721 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 19:43:25,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 07:43:24" (1/3) ... [2022-03-15 19:43:25,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69556a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:43:25, skipping insertion in model container [2022-03-15 19:43:25,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:25" (2/3) ... [2022-03-15 19:43:25,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69556a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:43:25, skipping insertion in model container [2022-03-15 19:43:25,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:43:25" (3/3) ... [2022-03-15 19:43:25,724 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-2.wvr.c [2022-03-15 19:43:25,730 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 19:43:25,731 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 19:43:25,731 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 19:43:25,731 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 19:43:25,780 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,781 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,781 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,781 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,782 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,782 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,782 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,782 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,782 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,782 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,783 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,783 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,783 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,783 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,784 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,784 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,784 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,784 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,784 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,785 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,785 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,785 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,785 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,785 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,785 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,786 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,786 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,786 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,786 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,786 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,786 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,787 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,787 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,787 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,787 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,787 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,788 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,788 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,788 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,788 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,788 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,788 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,789 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,789 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,789 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,789 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,789 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,789 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,790 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,790 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,790 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,790 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,791 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,792 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,792 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,792 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,792 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,792 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,799 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,800 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,800 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,800 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,800 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,800 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,800 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,801 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,802 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,802 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,802 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,802 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,802 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,803 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,803 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,803 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,803 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:25,808 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 19:43:25,859 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 19:43:25,868 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 19:43:25,868 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-15 19:43:25,886 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 19:43:25,898 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 136 transitions, 288 flow [2022-03-15 19:43:25,903 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 136 transitions, 288 flow [2022-03-15 19:43:25,905 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 132 places, 136 transitions, 288 flow [2022-03-15 19:43:25,982 INFO L129 PetriNetUnfolder]: 11/134 cut-off events. [2022-03-15 19:43:25,982 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 19:43:25,987 INFO L84 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 134 events. 11/134 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 99. Up to 3 conditions per place. [2022-03-15 19:43:25,990 INFO L116 LiptonReduction]: Number of co-enabled transitions 538 [2022-03-15 19:43:31,252 INFO L131 LiptonReduction]: Checked pairs total: 789 [2022-03-15 19:43:31,252 INFO L133 LiptonReduction]: Total number of compositions: 146 [2022-03-15 19:43:31,259 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 24 places, 20 transitions, 56 flow [2022-03-15 19:43:31,274 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 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 19:43:31,276 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 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 19:43:31,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 19:43:31,280 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:31,281 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:31,281 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:31,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:31,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1315241954, now seen corresponding path program 1 times [2022-03-15 19:43:31,301 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:31,301 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544236139] [2022-03-15 19:43:31,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:31,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:31,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:31,577 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:31,593 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544236139] [2022-03-15 19:43:31,594 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544236139] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:43:31,594 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:43:31,594 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:43:31,596 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [53336561] [2022-03-15 19:43:31,597 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:31,601 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:31,624 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 46 transitions. [2022-03-15 19:43:31,625 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:31,716 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:43:31,850 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:43:31,917 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 12 treesize of output 4 [2022-03-15 19:43:31,987 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:43:31,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:43:31,988 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:32,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:43:32,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:43:32,011 INFO L87 Difference]: Start difference. First operand has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 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) Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:32,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:32,063 INFO L93 Difference]: Finished difference Result 49 states and 96 transitions. [2022-03-15 19:43:32,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:43:32,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 14 [2022-03-15 19:43:32,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:32,072 INFO L225 Difference]: With dead ends: 49 [2022-03-15 19:43:32,072 INFO L226 Difference]: Without dead ends: 36 [2022-03-15 19:43:32,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:43:32,077 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 7 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:32,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 6 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:43:32,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-03-15 19:43:32,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-03-15 19:43:32,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 35 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:32,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 76 transitions. [2022-03-15 19:43:32,112 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 76 transitions. Word has length 14 [2022-03-15 19:43:32,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:32,113 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 76 transitions. [2022-03-15 19:43:32,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:32,116 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 76 transitions. [2022-03-15 19:43:32,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 19:43:32,118 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:32,118 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:32,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 19:43:32,118 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:32,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:32,120 INFO L85 PathProgramCache]: Analyzing trace with hash 504880804, now seen corresponding path program 1 times [2022-03-15 19:43:32,121 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:32,121 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792783040] [2022-03-15 19:43:32,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:32,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:32,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:43:32,302 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:32,303 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792783040] [2022-03-15 19:43:32,303 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792783040] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:43:32,303 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:43:32,303 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 19:43:32,303 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2002171506] [2022-03-15 19:43:32,303 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:32,305 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:32,310 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 47 transitions. [2022-03-15 19:43:32,310 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:32,340 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 26 treesize of output 10 [2022-03-15 19:43:32,424 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 26 treesize of output 10 [2022-03-15 19:43:32,619 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [339#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (= ~s~0 ~N~0)), 340#(or (< 0 ~N~0) (= ~s~0 ~N~0))] [2022-03-15 19:43:32,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:43:32,620 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:32,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:43:32,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-03-15 19:43:32,621 INFO L87 Difference]: Start difference. First operand 36 states and 76 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:32,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:32,748 INFO L93 Difference]: Finished difference Result 77 states and 167 transitions. [2022-03-15 19:43:32,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:43:32,749 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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 15 [2022-03-15 19:43:32,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:32,752 INFO L225 Difference]: With dead ends: 77 [2022-03-15 19:43:32,752 INFO L226 Difference]: Without dead ends: 72 [2022-03-15 19:43:32,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-03-15 19:43:32,754 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 37 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:32,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 14 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:43:32,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-03-15 19:43:32,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 58. [2022-03-15 19:43:32,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 2.2280701754385963) internal successors, (127), 57 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:32,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 127 transitions. [2022-03-15 19:43:32,767 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 127 transitions. Word has length 15 [2022-03-15 19:43:32,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:32,768 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 127 transitions. [2022-03-15 19:43:32,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:32,768 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 127 transitions. [2022-03-15 19:43:32,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 19:43:32,769 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:32,769 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:32,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 19:43:32,769 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:32,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:32,770 INFO L85 PathProgramCache]: Analyzing trace with hash 700550409, now seen corresponding path program 1 times [2022-03-15 19:43:32,771 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:32,774 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194589029] [2022-03-15 19:43:32,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:32,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:32,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:43:32,848 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:32,848 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194589029] [2022-03-15 19:43:32,848 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194589029] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:43:32,848 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:43:32,848 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 19:43:32,848 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1212100485] [2022-03-15 19:43:32,848 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:32,851 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:32,856 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 44 transitions. [2022-03-15 19:43:32,856 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:32,876 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 12 treesize of output 4 [2022-03-15 19:43:32,978 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:43:33,010 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 12 treesize of output 4 [2022-03-15 19:43:33,039 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2022-03-15 19:43:33,128 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [540#(or (<= (+ ~q_back~0 1) ~q_front~0) (< ~q_front~0 0)), 539#(or (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0))] [2022-03-15 19:43:33,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 19:43:33,128 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:33,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 19:43:33,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:43:33,129 INFO L87 Difference]: Start difference. First operand 58 states and 127 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 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 19:43:33,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:33,167 INFO L93 Difference]: Finished difference Result 50 states and 103 transitions. [2022-03-15 19:43:33,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:43:33,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 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 16 [2022-03-15 19:43:33,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:33,168 INFO L225 Difference]: With dead ends: 50 [2022-03-15 19:43:33,168 INFO L226 Difference]: Without dead ends: 50 [2022-03-15 19:43:33,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:43:33,169 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 5 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:33,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 6 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:43:33,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-03-15 19:43:33,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-03-15 19:43:33,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 49 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:33,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 103 transitions. [2022-03-15 19:43:33,175 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 103 transitions. Word has length 16 [2022-03-15 19:43:33,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:33,175 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 103 transitions. [2022-03-15 19:43:33,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 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 19:43:33,176 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 103 transitions. [2022-03-15 19:43:33,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 19:43:33,176 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:33,176 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:33,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 19:43:33,177 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:33,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:33,177 INFO L85 PathProgramCache]: Analyzing trace with hash 335942523, now seen corresponding path program 2 times [2022-03-15 19:43:33,178 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:33,178 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346869707] [2022-03-15 19:43:33,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:33,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:33,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:43:33,260 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:33,260 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346869707] [2022-03-15 19:43:33,261 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346869707] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:33,261 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619133539] [2022-03-15 19:43:33,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:43:33,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:33,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:33,263 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:33,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 19:43:33,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:43:33,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:33,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 19:43:33,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:33,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:33,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:33,727 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619133539] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:33,728 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:33,728 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2022-03-15 19:43:33,728 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2073719250] [2022-03-15 19:43:33,728 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:33,730 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:33,737 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 54 transitions. [2022-03-15 19:43:33,737 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:33,762 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 12 treesize of output 4 [2022-03-15 19:43:33,793 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2022-03-15 19:43:33,946 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:43:34,015 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:43:34,069 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 12 treesize of output 4 [2022-03-15 19:43:34,176 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [796#(or (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (< ~q_front~0 0)), 797#(or (<= ~q_back~0 ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))] [2022-03-15 19:43:34,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 19:43:34,176 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:34,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 19:43:34,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-03-15 19:43:34,178 INFO L87 Difference]: Start difference. First operand 50 states and 103 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:34,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:34,244 INFO L93 Difference]: Finished difference Result 82 states and 164 transitions. [2022-03-15 19:43:34,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:43:34,245 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 19:43:34,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:34,246 INFO L225 Difference]: With dead ends: 82 [2022-03-15 19:43:34,246 INFO L226 Difference]: Without dead ends: 68 [2022-03-15 19:43:34,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-03-15 19:43:34,247 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 27 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:34,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 6 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:43:34,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-03-15 19:43:34,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 52. [2022-03-15 19:43:34,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 2.2549019607843137) internal successors, (115), 51 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:34,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 115 transitions. [2022-03-15 19:43:34,252 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 115 transitions. Word has length 16 [2022-03-15 19:43:34,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:34,252 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 115 transitions. [2022-03-15 19:43:34,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:34,252 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 115 transitions. [2022-03-15 19:43:34,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 19:43:34,253 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:34,253 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:34,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:34,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:34,476 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:34,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:34,476 INFO L85 PathProgramCache]: Analyzing trace with hash -349287020, now seen corresponding path program 1 times [2022-03-15 19:43:34,477 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:34,478 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273568405] [2022-03-15 19:43:34,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:34,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:34,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:34,556 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:34,556 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273568405] [2022-03-15 19:43:34,556 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273568405] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:34,556 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185378915] [2022-03-15 19:43:34,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:34,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:34,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:34,558 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:34,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 19:43:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:34,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:43:34,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:34,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:34,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:34,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:34,787 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185378915] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:34,787 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:34,787 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-03-15 19:43:34,787 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1860810576] [2022-03-15 19:43:34,787 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:34,789 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:34,795 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 57 transitions. [2022-03-15 19:43:34,795 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:34,813 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 12 treesize of output 4 [2022-03-15 19:43:34,908 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:43:34,950 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 12 treesize of output 4 [2022-03-15 19:43:35,016 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 12 treesize of output 4 [2022-03-15 19:43:35,095 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [1059#(or (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))), 1087#(or (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0)), 1086#(or (<= ~q_back~0 0) (<= ~n~0 0))] [2022-03-15 19:43:35,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:43:35,095 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:35,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:43:35,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-03-15 19:43:35,096 INFO L87 Difference]: Start difference. First operand 52 states and 115 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 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 19:43:35,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:35,195 INFO L93 Difference]: Finished difference Result 76 states and 154 transitions. [2022-03-15 19:43:35,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:43:35,196 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 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 16 [2022-03-15 19:43:35,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:35,197 INFO L225 Difference]: With dead ends: 76 [2022-03-15 19:43:35,197 INFO L226 Difference]: Without dead ends: 53 [2022-03-15 19:43:35,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2022-03-15 19:43:35,198 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 22 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:35,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 19 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:43:35,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-03-15 19:43:35,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-03-15 19:43:35,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 2.230769230769231) internal successors, (116), 52 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:35,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 116 transitions. [2022-03-15 19:43:35,203 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 116 transitions. Word has length 16 [2022-03-15 19:43:35,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:35,203 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 116 transitions. [2022-03-15 19:43:35,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 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 19:43:35,203 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 116 transitions. [2022-03-15 19:43:35,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 19:43:35,204 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:35,204 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:35,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:35,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:35,420 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:35,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:35,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1717271594, now seen corresponding path program 2 times [2022-03-15 19:43:35,422 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:35,422 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759608244] [2022-03-15 19:43:35,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:35,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:35,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:35,768 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:35,768 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759608244] [2022-03-15 19:43:35,769 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759608244] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:35,769 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454463729] [2022-03-15 19:43:35,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:43:35,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:35,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:35,771 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:35,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 19:43:35,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:43:35,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:35,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 19:43:35,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:36,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:36,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:36,182 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-03-15 19:43:36,182 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 25 treesize of output 16 [2022-03-15 19:43:36,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:36,362 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454463729] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:36,362 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:36,362 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2022-03-15 19:43:36,362 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1553369697] [2022-03-15 19:43:36,362 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:36,365 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:36,371 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 58 transitions. [2022-03-15 19:43:36,371 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:37,396 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [1392#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 1394#(or (<= (+ 2 ~q_back~0) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~n~0 (+ ~q_back~0 1)) (<= ~N~0 0) (< ~q_front~0 0) (< 1 ~N~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 1391#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 1393#(or (<= (+ 2 ~q_back~0) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))] [2022-03-15 19:43:37,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:43:37,397 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:37,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:43:37,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2022-03-15 19:43:37,398 INFO L87 Difference]: Start difference. First operand 53 states and 116 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:37,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:37,838 INFO L93 Difference]: Finished difference Result 105 states and 225 transitions. [2022-03-15 19:43:37,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:43:37,838 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 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 19:43:37,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:37,839 INFO L225 Difference]: With dead ends: 105 [2022-03-15 19:43:37,839 INFO L226 Difference]: Without dead ends: 105 [2022-03-15 19:43:37,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=154, Invalid=658, Unknown=0, NotChecked=0, Total=812 [2022-03-15 19:43:37,840 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 39 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:37,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 36 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:43:37,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-03-15 19:43:37,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 86. [2022-03-15 19:43:37,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 2.2588235294117647) internal successors, (192), 85 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:37,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 192 transitions. [2022-03-15 19:43:37,846 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 192 transitions. Word has length 17 [2022-03-15 19:43:37,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:37,846 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 192 transitions. [2022-03-15 19:43:37,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:37,846 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 192 transitions. [2022-03-15 19:43:37,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 19:43:37,847 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:37,847 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:37,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:38,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:38,048 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:38,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:38,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1834349384, now seen corresponding path program 3 times [2022-03-15 19:43:38,049 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:38,049 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663052153] [2022-03-15 19:43:38,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:38,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:38,321 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:38,321 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:38,321 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663052153] [2022-03-15 19:43:38,321 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663052153] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:38,321 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753275993] [2022-03-15 19:43:38,321 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:43:38,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:38,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:38,324 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:38,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 19:43:38,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:43:38,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:38,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:43:38,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:38,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:38,522 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:43:38,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:43:38,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:38,581 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_172 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_172) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) 0))) is different from false [2022-03-15 19:43:38,600 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:43:38,600 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 45 treesize of output 45 [2022-03-15 19:43:38,603 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 24 treesize of output 18 [2022-03-15 19:43:38,686 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-03-15 19:43:38,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753275993] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:38,687 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:38,687 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 17 [2022-03-15 19:43:38,687 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [894791069] [2022-03-15 19:43:38,687 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:38,689 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:38,694 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 29 transitions. [2022-03-15 19:43:38,695 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:38,870 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [1794#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))] [2022-03-15 19:43:38,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:43:38,871 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:38,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:43:38,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=247, Unknown=1, NotChecked=32, Total=342 [2022-03-15 19:43:38,872 INFO L87 Difference]: Start difference. First operand 86 states and 192 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:39,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:39,098 INFO L93 Difference]: Finished difference Result 121 states and 272 transitions. [2022-03-15 19:43:39,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:43:39,099 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 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 19:43:39,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:39,100 INFO L225 Difference]: With dead ends: 121 [2022-03-15 19:43:39,100 INFO L226 Difference]: Without dead ends: 121 [2022-03-15 19:43:39,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=311, Unknown=1, NotChecked=36, Total=420 [2022-03-15 19:43:39,101 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 38 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:39,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 22 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:43:39,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-03-15 19:43:39,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 94. [2022-03-15 19:43:39,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 2.3440860215053765) internal successors, (218), 93 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:39,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 218 transitions. [2022-03-15 19:43:39,107 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 218 transitions. Word has length 17 [2022-03-15 19:43:39,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:39,107 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 218 transitions. [2022-03-15 19:43:39,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:39,107 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 218 transitions. [2022-03-15 19:43:39,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 19:43:39,108 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:39,108 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:39,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:39,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:39,309 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:39,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:39,309 INFO L85 PathProgramCache]: Analyzing trace with hash -313316636, now seen corresponding path program 4 times [2022-03-15 19:43:39,310 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:39,310 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108758113] [2022-03-15 19:43:39,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:39,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:39,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:39,589 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:39,590 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108758113] [2022-03-15 19:43:39,590 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108758113] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:39,590 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395181280] [2022-03-15 19:43:39,590 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:43:39,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:39,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:39,592 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:39,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 19:43:39,680 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:43:39,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:39,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 19:43:39,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:39,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:39,859 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:43:39,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:39,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:40,027 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:43:40,027 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 45 treesize of output 45 [2022-03-15 19:43:40,030 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 24 treesize of output 18 [2022-03-15 19:43:40,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:40,227 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395181280] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:40,227 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:40,227 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 21 [2022-03-15 19:43:40,227 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [561475613] [2022-03-15 19:43:40,227 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:40,230 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:40,235 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 23 transitions. [2022-03-15 19:43:40,235 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:40,342 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [2226#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= ~n~0 ~q_back~0) (< ~q_back~0 0)), 2227#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))] [2022-03-15 19:43:40,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:43:40,343 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:40,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:43:40,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=433, Unknown=1, NotChecked=0, Total=552 [2022-03-15 19:43:40,344 INFO L87 Difference]: Start difference. First operand 94 states and 218 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:40,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:40,512 INFO L93 Difference]: Finished difference Result 97 states and 221 transitions. [2022-03-15 19:43:40,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 19:43:40,512 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 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 19:43:40,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:40,513 INFO L225 Difference]: With dead ends: 97 [2022-03-15 19:43:40,513 INFO L226 Difference]: Without dead ends: 95 [2022-03-15 19:43:40,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=475, Unknown=1, NotChecked=0, Total=600 [2022-03-15 19:43:40,514 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 17 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:40,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 26 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:43:40,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-03-15 19:43:40,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2022-03-15 19:43:40,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 2.2613636363636362) internal successors, (199), 88 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:40,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 199 transitions. [2022-03-15 19:43:40,519 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 199 transitions. Word has length 17 [2022-03-15 19:43:40,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:40,519 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 199 transitions. [2022-03-15 19:43:40,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:40,519 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 199 transitions. [2022-03-15 19:43:40,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:43:40,520 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:40,520 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:40,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:40,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:40,721 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:40,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:40,722 INFO L85 PathProgramCache]: Analyzing trace with hash 168694921, now seen corresponding path program 1 times [2022-03-15 19:43:40,722 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:40,722 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25772007] [2022-03-15 19:43:40,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:40,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:41,049 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:41,050 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:41,050 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25772007] [2022-03-15 19:43:41,050 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25772007] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:41,050 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133245517] [2022-03-15 19:43:41,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:41,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:41,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:41,051 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:41,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 19:43:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:41,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-15 19:43:41,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:41,415 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-03-15 19:43:41,463 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:41,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:41,585 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:43:41,586 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 42 treesize of output 34 [2022-03-15 19:43:41,842 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:41,843 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133245517] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:41,843 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:41,843 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 24 [2022-03-15 19:43:41,843 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1330215855] [2022-03-15 19:43:41,843 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:41,846 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:41,854 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 65 transitions. [2022-03-15 19:43:41,854 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:43,780 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [2634#(and (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)))), 2635#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 2636#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 2633#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 2637#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (<= ~N~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< 1 ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (<= ~N~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< 1 ~N~0)))] [2022-03-15 19:43:43,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:43:43,781 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:43,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:43:43,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=733, Unknown=0, NotChecked=0, Total=930 [2022-03-15 19:43:43,782 INFO L87 Difference]: Start difference. First operand 89 states and 199 transitions. Second operand has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:45,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:45,418 INFO L93 Difference]: Finished difference Result 187 states and 408 transitions. [2022-03-15 19:43:45,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 19:43:45,419 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 19:43:45,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:45,421 INFO L225 Difference]: With dead ends: 187 [2022-03-15 19:43:45,421 INFO L226 Difference]: Without dead ends: 170 [2022-03-15 19:43:45,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 28 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=350, Invalid=1290, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 19:43:45,423 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 77 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:45,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 49 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:43:45,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-03-15 19:43:45,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 124. [2022-03-15 19:43:45,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 2.4471544715447155) internal successors, (301), 123 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:45,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 301 transitions. [2022-03-15 19:43:45,443 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 301 transitions. Word has length 18 [2022-03-15 19:43:45,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:45,443 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 301 transitions. [2022-03-15 19:43:45,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:45,443 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 301 transitions. [2022-03-15 19:43:45,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:43:45,444 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:45,444 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:45,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:45,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:45,645 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:45,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:45,646 INFO L85 PathProgramCache]: Analyzing trace with hash -576007577, now seen corresponding path program 2 times [2022-03-15 19:43:45,646 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:45,646 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70940772] [2022-03-15 19:43:45,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:45,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:45,919 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:45,920 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:45,920 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70940772] [2022-03-15 19:43:45,920 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70940772] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:45,920 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525435463] [2022-03-15 19:43:45,920 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:43:45,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:45,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:45,924 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:45,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 19:43:46,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:43:46,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:46,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 56 conjunts are in the unsatisfiable core [2022-03-15 19:43:46,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:46,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-03-15 19:43:46,128 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 15 treesize of output 11 [2022-03-15 19:43:46,164 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:43:46,202 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:43:46,300 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-03-15 19:43:46,386 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:46,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:46,839 INFO L353 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2022-03-15 19:43:46,839 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 118 treesize of output 83 [2022-03-15 19:43:46,850 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:43:46,850 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 226 treesize of output 218 [2022-03-15 19:43:46,859 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:43:46,859 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 182 [2022-03-15 19:43:46,867 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:43:46,867 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 164 [2022-03-15 19:43:47,329 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:47,329 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525435463] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:47,329 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:47,329 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-03-15 19:43:47,329 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1733743493] [2022-03-15 19:43:47,329 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:47,332 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:47,337 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 50 transitions. [2022-03-15 19:43:47,338 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:48,804 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [3224#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (< ~s~0 (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~N~0 ~s~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 3227#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (<= ~N~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< 1 ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (<= ~N~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< 1 ~N~0))), 3223#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 3226#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 3225#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)))] [2022-03-15 19:43:48,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:43:48,805 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:48,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:43:48,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=852, Unknown=6, NotChecked=0, Total=1056 [2022-03-15 19:43:48,806 INFO L87 Difference]: Start difference. First operand 124 states and 301 transitions. Second operand has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:50,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:50,065 INFO L93 Difference]: Finished difference Result 198 states and 424 transitions. [2022-03-15 19:43:50,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 19:43:50,066 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 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 18 [2022-03-15 19:43:50,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:50,067 INFO L225 Difference]: With dead ends: 198 [2022-03-15 19:43:50,067 INFO L226 Difference]: Without dead ends: 184 [2022-03-15 19:43:50,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 19 SyntacticMatches, 8 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=300, Invalid=1416, Unknown=6, NotChecked=0, Total=1722 [2022-03-15 19:43:50,068 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 79 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:50,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 30 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:43:50,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-03-15 19:43:50,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 126. [2022-03-15 19:43:50,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 2.448) internal successors, (306), 125 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:50,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 306 transitions. [2022-03-15 19:43:50,073 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 306 transitions. Word has length 18 [2022-03-15 19:43:50,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:50,073 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 306 transitions. [2022-03-15 19:43:50,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:50,074 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 306 transitions. [2022-03-15 19:43:50,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:43:50,074 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:50,074 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:50,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:50,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:50,283 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:50,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:50,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1400204457, now seen corresponding path program 3 times [2022-03-15 19:43:50,285 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:50,285 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999890563] [2022-03-15 19:43:50,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:50,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:50,650 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:50,650 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:50,650 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999890563] [2022-03-15 19:43:50,650 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999890563] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:50,650 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490025293] [2022-03-15 19:43:50,650 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:43:50,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:50,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:50,652 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:50,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 19:43:50,723 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:43:50,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:50,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 48 conjunts are in the unsatisfiable core [2022-03-15 19:43:50,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:50,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:50,973 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:43:51,039 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-03-15 19:43:51,099 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:51,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:51,168 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_316 (Array Int Int))) (< (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_316) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))) (+ c_~N~0 1))) (forall ((v_ArrVal_316 (Array Int Int))) (<= c_~N~0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_316) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))))) is different from false [2022-03-15 19:43:51,254 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:43:51,255 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 86 treesize of output 78 [2022-03-15 19:43:51,260 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 57 treesize of output 51 [2022-03-15 19:43:51,264 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 51 treesize of output 45 [2022-03-15 19:43:51,546 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:51,546 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490025293] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:51,546 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:51,546 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27 [2022-03-15 19:43:51,547 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1187963930] [2022-03-15 19:43:51,547 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:51,548 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:51,553 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 36 transitions. [2022-03-15 19:43:51,553 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:52,280 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [3827#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 3828#(and (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)))] [2022-03-15 19:43:52,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:43:52,280 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:52,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:43:52,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=736, Unknown=1, NotChecked=56, Total=930 [2022-03-15 19:43:52,281 INFO L87 Difference]: Start difference. First operand 126 states and 306 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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 19:43:52,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:52,790 INFO L93 Difference]: Finished difference Result 164 states and 378 transitions. [2022-03-15 19:43:52,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:43:52,791 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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 18 [2022-03-15 19:43:52,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:52,792 INFO L225 Difference]: With dead ends: 164 [2022-03-15 19:43:52,792 INFO L226 Difference]: Without dead ends: 159 [2022-03-15 19:43:52,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=192, Invalid=1001, Unknown=1, NotChecked=66, Total=1260 [2022-03-15 19:43:52,793 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 46 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:52,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 42 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:43:52,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-03-15 19:43:52,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 127. [2022-03-15 19:43:52,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 2.4365079365079363) internal successors, (307), 126 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:52,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 307 transitions. [2022-03-15 19:43:52,797 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 307 transitions. Word has length 18 [2022-03-15 19:43:52,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:52,798 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 307 transitions. [2022-03-15 19:43:52,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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 19:43:52,798 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 307 transitions. [2022-03-15 19:43:52,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:43:52,798 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:52,798 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:52,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:53,011 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,SelfDestructingSolverStorable10 [2022-03-15 19:43:53,011 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:53,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:53,012 INFO L85 PathProgramCache]: Analyzing trace with hash -766213363, now seen corresponding path program 4 times [2022-03-15 19:43:53,013 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:53,013 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84262607] [2022-03-15 19:43:53,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:53,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:53,401 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:53,402 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:53,402 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84262607] [2022-03-15 19:43:53,402 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84262607] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:53,402 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114232709] [2022-03-15 19:43:53,402 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:43:53,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:53,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:53,404 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:53,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 19:43:53,495 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:43:53,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:53,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 46 conjunts are in the unsatisfiable core [2022-03-15 19:43:53,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:53,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:53,742 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:43:53,835 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:43:53,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:53,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:54,125 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:43:54,126 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 115 treesize of output 99 [2022-03-15 19:43:54,134 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 71 treesize of output 53 [2022-03-15 19:43:54,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:54,580 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114232709] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:54,580 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:54,580 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27 [2022-03-15 19:43:54,581 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1994491923] [2022-03-15 19:43:54,581 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:54,582 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:54,586 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 30 transitions. [2022-03-15 19:43:54,586 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:55,064 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [4388#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 4389#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 4390#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)))] [2022-03-15 19:43:55,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:43:55,065 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:55,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:43:55,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=833, Unknown=3, NotChecked=0, Total=992 [2022-03-15 19:43:55,065 INFO L87 Difference]: Start difference. First operand 127 states and 307 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 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 19:43:55,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:55,643 INFO L93 Difference]: Finished difference Result 191 states and 430 transitions. [2022-03-15 19:43:55,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 19:43:55,643 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 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 18 [2022-03-15 19:43:55,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:55,645 INFO L225 Difference]: With dead ends: 191 [2022-03-15 19:43:55,645 INFO L226 Difference]: Without dead ends: 182 [2022-03-15 19:43:55,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=218, Invalid=1185, Unknown=3, NotChecked=0, Total=1406 [2022-03-15 19:43:55,646 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 72 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:55,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 26 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:43:55,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-03-15 19:43:55,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 127. [2022-03-15 19:43:55,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 2.4365079365079363) internal successors, (307), 126 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:55,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 307 transitions. [2022-03-15 19:43:55,650 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 307 transitions. Word has length 18 [2022-03-15 19:43:55,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:55,650 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 307 transitions. [2022-03-15 19:43:55,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 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 19:43:55,651 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 307 transitions. [2022-03-15 19:43:55,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:43:55,653 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:55,653 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:55,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:55,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:55,859 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:55,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:55,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1175120428, now seen corresponding path program 5 times [2022-03-15 19:43:55,860 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:55,861 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120422640] [2022-03-15 19:43:55,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:55,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:56,284 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 19:43:56,284 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:56,285 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120422640] [2022-03-15 19:43:56,285 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120422640] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:56,285 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506669522] [2022-03-15 19:43:56,285 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:43:56,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:56,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:56,286 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:56,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 19:43:56,388 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:43:56,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:56,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:43:56,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:56,460 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:43:56,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:56,494 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-03-15 19:43:56,494 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 25 treesize of output 16 [2022-03-15 19:43:56,521 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:43:56,522 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506669522] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:56,522 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:56,522 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 3] total 12 [2022-03-15 19:43:56,522 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [964288954] [2022-03-15 19:43:56,522 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:56,524 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:56,528 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 59 transitions. [2022-03-15 19:43:56,529 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:57,255 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [4963#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 4964#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 4965#(or (<= (+ 2 ~q_back~0) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))] [2022-03-15 19:43:57,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:43:57,256 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:57,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:43:57,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-03-15 19:43:57,256 INFO L87 Difference]: Start difference. First operand 127 states and 307 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 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 19:43:57,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:57,613 INFO L93 Difference]: Finished difference Result 182 states and 422 transitions. [2022-03-15 19:43:57,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:43:57,613 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 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 18 [2022-03-15 19:43:57,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:57,614 INFO L225 Difference]: With dead ends: 182 [2022-03-15 19:43:57,614 INFO L226 Difference]: Without dead ends: 182 [2022-03-15 19:43:57,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 40 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2022-03-15 19:43:57,615 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 37 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:57,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 27 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:43:57,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-03-15 19:43:57,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 146. [2022-03-15 19:43:57,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 2.420689655172414) internal successors, (351), 145 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:57,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 351 transitions. [2022-03-15 19:43:57,620 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 351 transitions. Word has length 18 [2022-03-15 19:43:57,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:57,620 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 351 transitions. [2022-03-15 19:43:57,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 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 19:43:57,620 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 351 transitions. [2022-03-15 19:43:57,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:43:57,621 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:57,621 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:57,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:57,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 19:43:57,835 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:57,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:57,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1918466746, now seen corresponding path program 6 times [2022-03-15 19:43:57,837 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:57,837 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688833491] [2022-03-15 19:43:57,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:57,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:58,446 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 19:43:58,446 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:58,446 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688833491] [2022-03-15 19:43:58,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688833491] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:58,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494658539] [2022-03-15 19:43:58,447 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:43:58,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:58,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:58,448 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:58,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 19:43:58,538 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:43:58,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:58,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 19:43:58,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:58,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:58,667 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:43:58,703 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:43:58,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:58,740 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_428 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_428) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) 0))) is different from false [2022-03-15 19:43:58,760 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:43:58,761 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 45 treesize of output 45 [2022-03-15 19:43:58,764 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 24 treesize of output 18 [2022-03-15 19:43:58,864 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2022-03-15 19:43:58,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494658539] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:58,865 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:58,865 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 5] total 19 [2022-03-15 19:43:58,865 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1053627928] [2022-03-15 19:43:58,865 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:58,867 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:58,871 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 30 transitions. [2022-03-15 19:43:58,871 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:59,035 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [5570#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))] [2022-03-15 19:43:59,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:43:59,036 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:59,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:43:59,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=320, Unknown=1, NotChecked=36, Total=420 [2022-03-15 19:43:59,036 INFO L87 Difference]: Start difference. First operand 146 states and 351 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:59,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:59,873 INFO L93 Difference]: Finished difference Result 172 states and 414 transitions. [2022-03-15 19:43:59,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:43:59,874 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 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 18 [2022-03-15 19:43:59,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:59,875 INFO L225 Difference]: With dead ends: 172 [2022-03-15 19:43:59,875 INFO L226 Difference]: Without dead ends: 172 [2022-03-15 19:43:59,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=100, Invalid=553, Unknown=1, NotChecked=48, Total=702 [2022-03-15 19:43:59,876 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 47 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:59,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 29 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:43:59,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-03-15 19:43:59,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 147. [2022-03-15 19:43:59,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 2.4246575342465753) internal successors, (354), 146 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:59,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 354 transitions. [2022-03-15 19:43:59,882 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 354 transitions. Word has length 18 [2022-03-15 19:43:59,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:59,882 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 354 transitions. [2022-03-15 19:43:59,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:59,882 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 354 transitions. [2022-03-15 19:43:59,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:43:59,885 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:59,885 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:59,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:00,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 19:44:00,091 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:00,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:00,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1495885258, now seen corresponding path program 5 times [2022-03-15 19:44:00,093 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:00,093 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015790146] [2022-03-15 19:44:00,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:00,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:00,133 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:44:00,134 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:00,134 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015790146] [2022-03-15 19:44:00,134 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015790146] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:00,134 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128895242] [2022-03-15 19:44:00,134 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:44:00,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:00,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:00,152 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:00,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 19:44:00,240 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:44:00,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:00,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 19:44:00,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:00,369 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:00,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:00,563 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:00,564 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128895242] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:00,564 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:00,564 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 18 [2022-03-15 19:44:00,564 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1140867622] [2022-03-15 19:44:00,564 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:00,566 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:00,574 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 72 transitions. [2022-03-15 19:44:00,574 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:00,591 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 12 treesize of output 4 [2022-03-15 19:44:00,662 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:44:00,682 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2022-03-15 19:44:00,787 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:44:00,810 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2022-03-15 19:44:00,880 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2022-03-15 19:44:00,940 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 12 treesize of output 4 [2022-03-15 19:44:00,963 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 12 treesize of output 4 [2022-03-15 19:44:01,050 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [6178#(or (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))), 6177#(or (<= ~q_back~0 (+ ~q_front~0 1)) (< ~q_front~0 0)), 6176#(or (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0))] [2022-03-15 19:44:01,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 19:44:01,051 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:01,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 19:44:01,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2022-03-15 19:44:01,052 INFO L87 Difference]: Start difference. First operand 147 states and 354 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:01,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:01,106 INFO L93 Difference]: Finished difference Result 230 states and 519 transitions. [2022-03-15 19:44:01,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:44:01,107 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 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 19 [2022-03-15 19:44:01,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:01,108 INFO L225 Difference]: With dead ends: 230 [2022-03-15 19:44:01,108 INFO L226 Difference]: Without dead ends: 212 [2022-03-15 19:44:01,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2022-03-15 19:44:01,109 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 51 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:01,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 6 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:44:01,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-03-15 19:44:01,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 180. [2022-03-15 19:44:01,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 2.3854748603351954) internal successors, (427), 179 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:01,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 427 transitions. [2022-03-15 19:44:01,115 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 427 transitions. Word has length 19 [2022-03-15 19:44:01,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:01,115 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 427 transitions. [2022-03-15 19:44:01,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:01,115 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 427 transitions. [2022-03-15 19:44:01,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:44:01,116 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:01,116 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:01,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:01,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 19:44:01,324 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:01,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:01,324 INFO L85 PathProgramCache]: Analyzing trace with hash 502911537, now seen corresponding path program 6 times [2022-03-15 19:44:01,325 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:01,325 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651086355] [2022-03-15 19:44:01,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:01,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:01,374 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:01,375 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:01,375 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651086355] [2022-03-15 19:44:01,375 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651086355] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:01,375 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488007972] [2022-03-15 19:44:01,375 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:44:01,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:01,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:01,377 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:01,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 19:44:01,491 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 19:44:01,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:01,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:44:01,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:01,601 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:01,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:01,697 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:01,697 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488007972] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:01,697 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:01,698 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 19:44:01,698 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1122871185] [2022-03-15 19:44:01,698 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:01,700 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:01,706 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 53 transitions. [2022-03-15 19:44:01,706 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:01,720 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 12 treesize of output 4 [2022-03-15 19:44:01,790 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:44:01,806 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 12 treesize of output 4 [2022-03-15 19:44:01,831 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 12 treesize of output 4 [2022-03-15 19:44:01,860 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2022-03-15 19:44:01,884 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 12 treesize of output 4 [2022-03-15 19:44:01,968 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [6896#(or (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0)), 6857#(or (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))), 6897#(or (<= ~q_back~0 0) (<= ~n~0 (+ ~q_back~0 1))), 6898#(or (< ~q_back~0 0) (<= ~n~0 (+ 2 ~q_back~0))), 6895#(or (<= ~q_back~0 0) (<= ~n~0 0))] [2022-03-15 19:44:01,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:44:01,968 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:01,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:44:01,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2022-03-15 19:44:01,969 INFO L87 Difference]: Start difference. First operand 180 states and 427 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 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 19:44:02,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:02,090 INFO L93 Difference]: Finished difference Result 171 states and 364 transitions. [2022-03-15 19:44:02,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:44:02,091 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 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 19 [2022-03-15 19:44:02,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:02,091 INFO L225 Difference]: With dead ends: 171 [2022-03-15 19:44:02,092 INFO L226 Difference]: Without dead ends: 122 [2022-03-15 19:44:02,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2022-03-15 19:44:02,092 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 40 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:02,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 25 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:44:02,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-03-15 19:44:02,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-03-15 19:44:02,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 2.2975206611570247) internal successors, (278), 121 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:02,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 278 transitions. [2022-03-15 19:44:02,097 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 278 transitions. Word has length 19 [2022-03-15 19:44:02,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:02,097 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 278 transitions. [2022-03-15 19:44:02,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 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 19:44:02,097 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 278 transitions. [2022-03-15 19:44:02,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:44:02,098 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:02,098 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:02,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:02,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 19:44:02,311 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:02,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:02,312 INFO L85 PathProgramCache]: Analyzing trace with hash -204488117, now seen corresponding path program 7 times [2022-03-15 19:44:02,313 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:02,313 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797428550] [2022-03-15 19:44:02,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:02,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:02,744 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:02,745 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:02,745 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797428550] [2022-03-15 19:44:02,745 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797428550] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:02,745 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497185936] [2022-03-15 19:44:02,745 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:44:02,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:02,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:02,748 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:02,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 19:44:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:02,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 38 conjunts are in the unsatisfiable core [2022-03-15 19:44:02,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:03,025 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:44:03,089 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:44:03,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:03,206 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:03,207 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 53 treesize of output 37 [2022-03-15 19:44:03,313 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:44:03,313 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497185936] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:03,313 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:03,313 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 5] total 20 [2022-03-15 19:44:03,313 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2041051044] [2022-03-15 19:44:03,313 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:03,316 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:03,322 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 66 transitions. [2022-03-15 19:44:03,323 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:05,379 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [7451#(and (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)))), 7453#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 7454#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (<= ~N~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< 1 ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (<= ~N~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< 1 ~N~0))), 7450#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 7452#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)))] [2022-03-15 19:44:05,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:44:05,380 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:05,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:44:05,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=557, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:44:05,381 INFO L87 Difference]: Start difference. First operand 122 states and 278 transitions. Second operand has 17 states, 16 states have (on average 2.75) internal successors, (44), 16 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 19:44:06,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:06,482 INFO L93 Difference]: Finished difference Result 236 states and 509 transitions. [2022-03-15 19:44:06,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 19:44:06,483 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.75) internal successors, (44), 16 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 19 [2022-03-15 19:44:06,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:06,484 INFO L225 Difference]: With dead ends: 236 [2022-03-15 19:44:06,484 INFO L226 Difference]: Without dead ends: 206 [2022-03-15 19:44:06,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=253, Invalid=937, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:44:06,485 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 88 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:06,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 50 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:44:06,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-03-15 19:44:06,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 154. [2022-03-15 19:44:06,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 2.3856209150326797) internal successors, (365), 153 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:06,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 365 transitions. [2022-03-15 19:44:06,489 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 365 transitions. Word has length 19 [2022-03-15 19:44:06,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:06,490 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 365 transitions. [2022-03-15 19:44:06,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.75) internal successors, (44), 16 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 19:44:06,490 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 365 transitions. [2022-03-15 19:44:06,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:44:06,490 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:06,490 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:06,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:06,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:06,724 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:06,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:06,725 INFO L85 PathProgramCache]: Analyzing trace with hash -949190615, now seen corresponding path program 8 times [2022-03-15 19:44:06,725 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:06,725 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902411633] [2022-03-15 19:44:06,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:06,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:07,249 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:07,249 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:07,249 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902411633] [2022-03-15 19:44:07,249 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902411633] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:07,249 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560132904] [2022-03-15 19:44:07,250 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:44:07,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:07,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:07,252 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:07,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 19:44:07,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:44:07,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:07,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 19:44:07,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:07,450 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:44:07,520 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:44:07,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:07,605 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:07,606 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 42 treesize of output 34 [2022-03-15 19:44:07,700 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:44:07,701 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560132904] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:07,701 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:07,701 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 5] total 19 [2022-03-15 19:44:07,701 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [267275179] [2022-03-15 19:44:07,701 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:07,703 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:07,709 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 51 transitions. [2022-03-15 19:44:07,710 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:09,288 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [8145#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 8144#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 8148#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (<= ~N~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< 1 ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (<= ~N~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< 1 ~N~0))), 8147#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 8146#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)))] [2022-03-15 19:44:09,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:44:09,288 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:09,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:44:09,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2022-03-15 19:44:09,289 INFO L87 Difference]: Start difference. First operand 154 states and 365 transitions. Second operand has 17 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:10,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:10,706 INFO L93 Difference]: Finished difference Result 226 states and 488 transitions. [2022-03-15 19:44:10,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:44:10,707 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.4375) internal successors, (39), 16 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 19 [2022-03-15 19:44:10,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:10,708 INFO L225 Difference]: With dead ends: 226 [2022-03-15 19:44:10,708 INFO L226 Difference]: Without dead ends: 212 [2022-03-15 19:44:10,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 28 SyntacticMatches, 9 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=198, Invalid=992, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:44:10,709 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 83 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:10,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 36 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:44:10,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-03-15 19:44:10,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 156. [2022-03-15 19:44:10,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 2.3870967741935485) internal successors, (370), 155 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:10,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 370 transitions. [2022-03-15 19:44:10,715 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 370 transitions. Word has length 19 [2022-03-15 19:44:10,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:10,715 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 370 transitions. [2022-03-15 19:44:10,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:10,715 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 370 transitions. [2022-03-15 19:44:10,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:44:10,716 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:10,716 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:10,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:10,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 19:44:10,931 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:10,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:10,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1773387495, now seen corresponding path program 9 times [2022-03-15 19:44:10,932 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:10,933 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228716031] [2022-03-15 19:44:10,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:10,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:11,423 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:11,424 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:11,424 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228716031] [2022-03-15 19:44:11,424 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228716031] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:11,424 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211754022] [2022-03-15 19:44:11,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:44:11,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:11,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:11,426 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:11,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 19:44:11,573 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:44:11,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:11,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 19:44:11,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:11,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:11,734 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:44:11,795 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:44:11,862 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:44:11,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:11,962 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_611) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))) (or (let ((.cse0 (+ c_~s~0 .cse1))) (and (<= c_~N~0 .cse0) (< .cse0 (+ c_~N~0 1)))) (= .cse1 0)))) is different from false [2022-03-15 19:44:12,031 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:12,031 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 115 treesize of output 99 [2022-03-15 19:44:12,037 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 71 treesize of output 53 [2022-03-15 19:44:12,270 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:44:12,271 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211754022] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:12,271 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:12,271 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 24 [2022-03-15 19:44:12,271 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1022184477] [2022-03-15 19:44:12,271 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:12,273 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:12,276 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 37 transitions. [2022-03-15 19:44:12,277 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:12,894 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [8839#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 8840#(and (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1))))] [2022-03-15 19:44:12,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:44:12,894 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:12,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:44:12,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=594, Unknown=1, NotChecked=50, Total=756 [2022-03-15 19:44:12,895 INFO L87 Difference]: Start difference. First operand 156 states and 370 transitions. Second operand has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:13,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:13,729 INFO L93 Difference]: Finished difference Result 195 states and 465 transitions. [2022-03-15 19:44:13,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 19:44:13,730 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 19:44:13,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:13,730 INFO L225 Difference]: With dead ends: 195 [2022-03-15 19:44:13,730 INFO L226 Difference]: Without dead ends: 169 [2022-03-15 19:44:13,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=208, Invalid=1055, Unknown=1, NotChecked=68, Total=1332 [2022-03-15 19:44:13,731 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 48 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:13,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 46 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:44:13,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-03-15 19:44:13,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 157. [2022-03-15 19:44:13,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 2.4166666666666665) internal successors, (377), 156 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:13,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 377 transitions. [2022-03-15 19:44:13,736 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 377 transitions. Word has length 19 [2022-03-15 19:44:13,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:13,736 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 377 transitions. [2022-03-15 19:44:13,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:13,736 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 377 transitions. [2022-03-15 19:44:13,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:44:13,737 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:13,737 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:13,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:13,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:13,955 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:13,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:13,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1139396401, now seen corresponding path program 10 times [2022-03-15 19:44:13,956 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:13,956 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243324666] [2022-03-15 19:44:13,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:13,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:14,496 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:14,496 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:14,497 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243324666] [2022-03-15 19:44:14,497 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243324666] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:14,497 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041081707] [2022-03-15 19:44:14,497 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:44:14,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:14,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:14,500 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:14,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 19:44:14,602 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:44:14,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:14,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 19:44:14,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:14,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:14,758 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:44:14,806 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-03-15 19:44:14,879 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:44:14,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:15,035 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:15,035 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 111 treesize of output 95 [2022-03-15 19:44:15,039 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 67 treesize of output 49 [2022-03-15 19:44:15,305 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:44:15,305 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041081707] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:15,305 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:15,305 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 25 [2022-03-15 19:44:15,305 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [506398420] [2022-03-15 19:44:15,305 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:15,308 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:15,311 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 31 transitions. [2022-03-15 19:44:15,311 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:15,788 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [9504#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (<= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 9503#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (<= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 9505#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)))] [2022-03-15 19:44:15,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:44:15,788 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:15,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:44:15,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=750, Unknown=3, NotChecked=0, Total=870 [2022-03-15 19:44:15,789 INFO L87 Difference]: Start difference. First operand 157 states and 377 transitions. Second operand has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:16,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:16,374 INFO L93 Difference]: Finished difference Result 176 states and 404 transitions. [2022-03-15 19:44:16,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:44:16,374 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 19:44:16,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:16,375 INFO L225 Difference]: With dead ends: 176 [2022-03-15 19:44:16,375 INFO L226 Difference]: Without dead ends: 167 [2022-03-15 19:44:16,375 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=151, Invalid=1036, Unknown=3, NotChecked=0, Total=1190 [2022-03-15 19:44:16,376 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 39 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:16,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 37 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:44:16,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-03-15 19:44:16,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 155. [2022-03-15 19:44:16,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 2.4155844155844157) internal successors, (372), 154 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:16,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 372 transitions. [2022-03-15 19:44:16,381 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 372 transitions. Word has length 19 [2022-03-15 19:44:16,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:16,381 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 372 transitions. [2022-03-15 19:44:16,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:16,381 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 372 transitions. [2022-03-15 19:44:16,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:44:16,382 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:16,382 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:16,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-03-15 19:44:16,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:16,592 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:16,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:16,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1548303466, now seen corresponding path program 7 times [2022-03-15 19:44:16,592 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:16,593 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331782588] [2022-03-15 19:44:16,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:16,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:17,115 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:17,115 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:17,115 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331782588] [2022-03-15 19:44:17,115 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331782588] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:17,115 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556851618] [2022-03-15 19:44:17,115 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:44:17,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:17,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:17,116 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:17,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 19:44:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:17,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 19:44:17,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:17,309 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:44:17,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:17,343 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-03-15 19:44:17,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 25 treesize of output 16 [2022-03-15 19:44:17,369 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:44:17,370 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556851618] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:17,370 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:17,370 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 3] total 15 [2022-03-15 19:44:17,370 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [410802075] [2022-03-15 19:44:17,370 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:17,372 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:17,377 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 60 transitions. [2022-03-15 19:44:17,377 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:18,022 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [10126#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 10127#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 10128#(or (<= (+ 2 ~q_back~0) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))] [2022-03-15 19:44:18,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:44:18,023 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:18,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:44:18,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2022-03-15 19:44:18,023 INFO L87 Difference]: Start difference. First operand 155 states and 372 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:18,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:18,593 INFO L93 Difference]: Finished difference Result 237 states and 545 transitions. [2022-03-15 19:44:18,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 19:44:18,594 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 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 19 [2022-03-15 19:44:18,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:18,595 INFO L225 Difference]: With dead ends: 237 [2022-03-15 19:44:18,595 INFO L226 Difference]: Without dead ends: 237 [2022-03-15 19:44:18,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2022-03-15 19:44:18,596 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 45 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:18,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 28 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:44:18,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-03-15 19:44:18,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 179. [2022-03-15 19:44:18,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 2.393258426966292) internal successors, (426), 178 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:18,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 426 transitions. [2022-03-15 19:44:18,601 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 426 transitions. Word has length 19 [2022-03-15 19:44:18,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:18,602 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 426 transitions. [2022-03-15 19:44:18,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:18,602 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 426 transitions. [2022-03-15 19:44:18,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:44:18,602 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:18,603 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:18,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:18,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:18,815 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:18,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:18,816 INFO L85 PathProgramCache]: Analyzing trace with hash -692402166, now seen corresponding path program 8 times [2022-03-15 19:44:18,816 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:18,817 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005671837] [2022-03-15 19:44:18,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:18,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:19,113 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:19,113 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:19,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005671837] [2022-03-15 19:44:19,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005671837] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:19,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30102631] [2022-03-15 19:44:19,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:44:19,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:19,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:19,115 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:19,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 19:44:19,244 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:44:19,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:19,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 19:44:19,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:19,332 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:44:19,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:19,362 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-03-15 19:44:19,362 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 25 treesize of output 16 [2022-03-15 19:44:19,391 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:44:19,391 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30102631] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:19,391 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:44:19,391 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9, 6] total 15 [2022-03-15 19:44:19,392 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [201972644] [2022-03-15 19:44:19,392 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:19,394 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:19,399 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 45 transitions. [2022-03-15 19:44:19,399 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:19,642 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [10863#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 10864#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= (+ ~q_back~0 1) ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 10862#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (< ~q_back~0 0))] [2022-03-15 19:44:19,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 19:44:19,643 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:19,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 19:44:19,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-03-15 19:44:19,643 INFO L87 Difference]: Start difference. First operand 179 states and 426 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 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 19:44:19,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:19,696 INFO L93 Difference]: Finished difference Result 240 states and 578 transitions. [2022-03-15 19:44:19,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:44:19,696 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 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 19 [2022-03-15 19:44:19,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:19,698 INFO L225 Difference]: With dead ends: 240 [2022-03-15 19:44:19,698 INFO L226 Difference]: Without dead ends: 240 [2022-03-15 19:44:19,700 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-03-15 19:44:19,700 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 28 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:19,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 11 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:44:19,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-03-15 19:44:19,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 165. [2022-03-15 19:44:19,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 2.4207317073170733) internal successors, (397), 164 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:19,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 397 transitions. [2022-03-15 19:44:19,711 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 397 transitions. Word has length 19 [2022-03-15 19:44:19,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:19,711 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 397 transitions. [2022-03-15 19:44:19,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 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 19:44:19,711 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 397 transitions. [2022-03-15 19:44:19,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:44:19,712 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:19,712 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:19,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:19,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:19,927 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:19,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:19,928 INFO L85 PathProgramCache]: Analyzing trace with hash 2003317512, now seen corresponding path program 9 times [2022-03-15 19:44:19,929 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:19,929 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410644421] [2022-03-15 19:44:19,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:19,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:20,502 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:20,502 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:20,502 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410644421] [2022-03-15 19:44:20,502 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410644421] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:20,502 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898420266] [2022-03-15 19:44:20,502 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:44:20,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:20,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:20,504 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:20,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 19:44:20,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:44:20,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:20,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:44:20,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:20,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:20,684 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:44:20,709 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:44:20,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:20,740 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_777) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) 0))) is different from false [2022-03-15 19:44:20,756 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:20,757 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 45 treesize of output 45 [2022-03-15 19:44:20,759 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-03-15 19:44:20,839 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 1 not checked. [2022-03-15 19:44:20,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898420266] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:20,840 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:20,840 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 18 [2022-03-15 19:44:20,840 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1109918170] [2022-03-15 19:44:20,840 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:20,841 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:20,845 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 31 transitions. [2022-03-15 19:44:20,845 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:20,977 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [11562#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))] [2022-03-15 19:44:20,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:44:20,977 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:20,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:44:20,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2022-03-15 19:44:20,978 INFO L87 Difference]: Start difference. First operand 165 states and 397 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 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 19:44:21,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:21,894 INFO L93 Difference]: Finished difference Result 260 states and 614 transitions. [2022-03-15 19:44:21,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 19:44:21,894 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 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 19 [2022-03-15 19:44:21,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:21,895 INFO L225 Difference]: With dead ends: 260 [2022-03-15 19:44:21,895 INFO L226 Difference]: Without dead ends: 260 [2022-03-15 19:44:21,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=102, Invalid=551, Unknown=1, NotChecked=48, Total=702 [2022-03-15 19:44:21,896 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 41 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:21,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 31 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:44:21,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-03-15 19:44:21,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 176. [2022-03-15 19:44:21,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 2.44) internal successors, (427), 175 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:21,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 427 transitions. [2022-03-15 19:44:21,902 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 427 transitions. Word has length 19 [2022-03-15 19:44:21,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:21,902 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 427 transitions. [2022-03-15 19:44:21,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 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 19:44:21,902 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 427 transitions. [2022-03-15 19:44:21,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:44:21,903 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:21,903 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:21,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:22,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-03-15 19:44:22,111 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:22,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:22,112 INFO L85 PathProgramCache]: Analyzing trace with hash -144348508, now seen corresponding path program 10 times [2022-03-15 19:44:22,113 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:22,113 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647130484] [2022-03-15 19:44:22,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:22,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:22,654 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:22,654 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:22,654 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647130484] [2022-03-15 19:44:22,655 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647130484] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:22,655 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527061663] [2022-03-15 19:44:22,655 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:44:22,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:22,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:22,656 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:22,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 19:44:22,746 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:44:22,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:22,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 19:44:22,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:22,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:22,895 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:44:22,921 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:44:22,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:22,951 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_820 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_820) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) 0))) is different from false [2022-03-15 19:44:22,960 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:22,960 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 45 treesize of output 45 [2022-03-15 19:44:22,962 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 24 treesize of output 18 [2022-03-15 19:44:23,037 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:44:23,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527061663] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:23,037 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:44:23,037 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 8] total 22 [2022-03-15 19:44:23,037 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1850835633] [2022-03-15 19:44:23,037 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:23,039 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:23,042 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 25 transitions. [2022-03-15 19:44:23,042 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:23,132 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [12321#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 12320#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (< ~q_back~0 0))] [2022-03-15 19:44:23,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 19:44:23,132 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:23,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 19:44:23,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=474, Unknown=1, NotChecked=44, Total=600 [2022-03-15 19:44:23,133 INFO L87 Difference]: Start difference. First operand 176 states and 427 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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 19:44:23,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:23,217 INFO L93 Difference]: Finished difference Result 189 states and 464 transitions. [2022-03-15 19:44:23,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 19:44:23,217 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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 19 [2022-03-15 19:44:23,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:23,218 INFO L225 Difference]: With dead ends: 189 [2022-03-15 19:44:23,218 INFO L226 Difference]: Without dead ends: 189 [2022-03-15 19:44:23,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=562, Unknown=1, NotChecked=48, Total=702 [2022-03-15 19:44:23,220 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 11 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:23,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 11 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 0 Unknown, 23 Unchecked, 0.0s Time] [2022-03-15 19:44:23,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-03-15 19:44:23,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 179. [2022-03-15 19:44:23,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 2.443820224719101) internal successors, (435), 178 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:23,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 435 transitions. [2022-03-15 19:44:23,225 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 435 transitions. Word has length 19 [2022-03-15 19:44:23,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:23,225 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 435 transitions. [2022-03-15 19:44:23,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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 19:44:23,225 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 435 transitions. [2022-03-15 19:44:23,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:44:23,226 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:23,226 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:23,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:23,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-03-15 19:44:23,427 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:23,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:23,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1819139247, now seen corresponding path program 11 times [2022-03-15 19:44:23,428 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:23,428 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788970072] [2022-03-15 19:44:23,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:23,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:23,664 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:23,664 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:23,664 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788970072] [2022-03-15 19:44:23,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788970072] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:23,665 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69260582] [2022-03-15 19:44:23,665 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:44:23,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:23,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:23,666 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:23,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 19:44:23,782 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:44:23,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:23,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 19:44:23,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:24,027 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:24,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:24,097 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-03-15 19:44:24,098 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 25 treesize of output 16 [2022-03-15 19:44:24,435 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:24,435 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69260582] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:24,435 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:24,435 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2022-03-15 19:44:24,435 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2035104726] [2022-03-15 19:44:24,435 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:24,437 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:24,442 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 54 transitions. [2022-03-15 19:44:24,443 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:25,115 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [13020#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0))), 13019#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)), 13017#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 13018#(or (<= (+ 2 ~q_back~0) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 13016#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))] [2022-03-15 19:44:25,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:44:25,115 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:25,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:44:25,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=910, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:44:25,116 INFO L87 Difference]: Start difference. First operand 179 states and 435 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:25,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:25,930 INFO L93 Difference]: Finished difference Result 350 states and 844 transitions. [2022-03-15 19:44:25,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:44:25,930 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 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 19:44:25,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:25,932 INFO L225 Difference]: With dead ends: 350 [2022-03-15 19:44:25,932 INFO L226 Difference]: Without dead ends: 350 [2022-03-15 19:44:25,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=434, Invalid=1822, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 19:44:25,933 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 128 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:25,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 43 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:44:25,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-03-15 19:44:25,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 213. [2022-03-15 19:44:25,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 2.660377358490566) internal successors, (564), 212 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:25,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 564 transitions. [2022-03-15 19:44:25,940 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 564 transitions. Word has length 20 [2022-03-15 19:44:25,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:25,941 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 564 transitions. [2022-03-15 19:44:25,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:25,941 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 564 transitions. [2022-03-15 19:44:25,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:44:25,941 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:25,942 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:25,967 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 19:44:26,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:26,142 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:26,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:26,143 INFO L85 PathProgramCache]: Analyzing trace with hash 312417545, now seen corresponding path program 12 times [2022-03-15 19:44:26,143 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:26,143 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777089229] [2022-03-15 19:44:26,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:26,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:26,442 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:26,442 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:26,442 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777089229] [2022-03-15 19:44:26,442 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777089229] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:26,443 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969415890] [2022-03-15 19:44:26,443 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:44:26,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:26,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:26,444 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:26,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-15 19:44:26,540 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:44:26,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:26,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 19:44:26,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:26,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:26,769 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:44:26,845 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:26,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:27,013 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:27,014 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 47 treesize of output 47 [2022-03-15 19:44:27,017 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 25 treesize of output 18 [2022-03-15 19:44:27,332 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:27,332 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969415890] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:27,332 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:27,332 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30 [2022-03-15 19:44:27,332 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1450372908] [2022-03-15 19:44:27,332 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:27,336 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:27,341 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 38 transitions. [2022-03-15 19:44:27,342 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:27,641 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [13971#(or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)), 13970#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))] [2022-03-15 19:44:27,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:44:27,641 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:27,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:44:27,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=884, Unknown=5, NotChecked=0, Total=1056 [2022-03-15 19:44:27,642 INFO L87 Difference]: Start difference. First operand 213 states and 564 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:28,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:28,682 INFO L93 Difference]: Finished difference Result 309 states and 797 transitions. [2022-03-15 19:44:28,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 19:44:28,682 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 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 19:44:28,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:28,684 INFO L225 Difference]: With dead ends: 309 [2022-03-15 19:44:28,684 INFO L226 Difference]: Without dead ends: 309 [2022-03-15 19:44:28,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=407, Invalid=1843, Unknown=6, NotChecked=0, Total=2256 [2022-03-15 19:44:28,685 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 61 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:28,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 41 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:44:28,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-03-15 19:44:28,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 222. [2022-03-15 19:44:28,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 2.723981900452489) internal successors, (602), 221 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:28,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 602 transitions. [2022-03-15 19:44:28,693 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 602 transitions. Word has length 20 [2022-03-15 19:44:28,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:28,693 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 602 transitions. [2022-03-15 19:44:28,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:28,693 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 602 transitions. [2022-03-15 19:44:28,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:44:28,694 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:28,694 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:28,719 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 19:44:28,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:28,920 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:28,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:28,920 INFO L85 PathProgramCache]: Analyzing trace with hash 946408639, now seen corresponding path program 13 times [2022-03-15 19:44:28,920 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:28,921 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623308334] [2022-03-15 19:44:28,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:28,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:29,167 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:29,167 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:29,167 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623308334] [2022-03-15 19:44:29,168 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623308334] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:29,168 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490532192] [2022-03-15 19:44:29,168 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:44:29,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:29,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:29,169 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:29,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-15 19:44:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:29,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 19:44:29,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:29,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:29,386 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:44:29,430 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:44:29,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:29,477 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_936 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_936) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset 4)) 0))) is different from false [2022-03-15 19:44:29,487 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:29,487 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 47 treesize of output 47 [2022-03-15 19:44:29,493 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 25 treesize of output 18 [2022-03-15 19:44:29,588 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:44:29,589 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490532192] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:29,589 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:29,589 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 7] total 25 [2022-03-15 19:44:29,589 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1947998880] [2022-03-15 19:44:29,589 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:29,591 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:29,595 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 32 transitions. [2022-03-15 19:44:29,595 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:29,807 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [14897#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)), 14896#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 14895#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))] [2022-03-15 19:44:29,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:44:29,807 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:29,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:44:29,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=649, Unknown=1, NotChecked=52, Total=812 [2022-03-15 19:44:29,808 INFO L87 Difference]: Start difference. First operand 222 states and 602 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:30,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:30,593 INFO L93 Difference]: Finished difference Result 329 states and 823 transitions. [2022-03-15 19:44:30,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:44:30,593 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 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 19:44:30,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:30,595 INFO L225 Difference]: With dead ends: 329 [2022-03-15 19:44:30,595 INFO L226 Difference]: Without dead ends: 325 [2022-03-15 19:44:30,595 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=201, Invalid=1208, Unknown=1, NotChecked=72, Total=1482 [2022-03-15 19:44:30,595 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 80 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:30,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 37 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:44:30,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-03-15 19:44:30,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 224. [2022-03-15 19:44:30,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 2.704035874439462) internal successors, (603), 223 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:30,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 603 transitions. [2022-03-15 19:44:30,609 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 603 transitions. Word has length 20 [2022-03-15 19:44:30,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:30,609 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 603 transitions. [2022-03-15 19:44:30,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:30,610 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 603 transitions. [2022-03-15 19:44:30,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:44:30,611 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:30,611 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:30,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:30,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-15 19:44:30,824 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:30,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:30,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1111739593, now seen corresponding path program 14 times [2022-03-15 19:44:30,825 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:30,825 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549290953] [2022-03-15 19:44:30,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:30,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:31,259 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:31,259 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:31,259 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549290953] [2022-03-15 19:44:31,260 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549290953] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:31,260 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906785652] [2022-03-15 19:44:31,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:44:31,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:31,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:31,261 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:31,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-15 19:44:31,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:44:31,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:31,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 19:44:31,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:31,520 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:44:31,572 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:44:31,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:31,657 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:31,657 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 40 treesize of output 32 [2022-03-15 19:44:31,747 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:44:31,747 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906785652] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:31,747 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:31,747 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 5] total 21 [2022-03-15 19:44:31,748 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [627124247] [2022-03-15 19:44:31,748 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:31,749 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:31,756 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 67 transitions. [2022-03-15 19:44:31,756 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:33,519 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [15836#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (<= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (<= ~N~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< 1 ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (<= ~N~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< 1 ~N~0))), 15833#(and (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0))), 15834#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 15832#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (<= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 15835#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (<= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)))] [2022-03-15 19:44:33,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:44:33,519 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:33,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:44:33,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2022-03-15 19:44:33,520 INFO L87 Difference]: Start difference. First operand 224 states and 603 transitions. Second operand has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:34,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:34,920 INFO L93 Difference]: Finished difference Result 365 states and 891 transitions. [2022-03-15 19:44:34,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:44:34,921 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 19:44:34,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:34,922 INFO L225 Difference]: With dead ends: 365 [2022-03-15 19:44:34,922 INFO L226 Difference]: Without dead ends: 347 [2022-03-15 19:44:34,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=308, Invalid=1414, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 19:44:34,923 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 72 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:34,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 58 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:44:34,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-03-15 19:44:34,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 244. [2022-03-15 19:44:34,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 2.683127572016461) internal successors, (652), 243 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:34,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 652 transitions. [2022-03-15 19:44:34,930 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 652 transitions. Word has length 20 [2022-03-15 19:44:34,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:34,930 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 652 transitions. [2022-03-15 19:44:34,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:34,930 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 652 transitions. [2022-03-15 19:44:34,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:44:34,931 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:34,931 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:34,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:35,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-15 19:44:35,139 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:35,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:35,140 INFO L85 PathProgramCache]: Analyzing trace with hash 367037095, now seen corresponding path program 15 times [2022-03-15 19:44:35,140 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:35,141 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847990269] [2022-03-15 19:44:35,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:35,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:35,585 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:35,585 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:35,585 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847990269] [2022-03-15 19:44:35,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847990269] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:35,585 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803059518] [2022-03-15 19:44:35,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:44:35,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:35,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:35,587 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:35,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-15 19:44:35,681 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:44:35,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:35,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 19:44:35,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:35,771 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:44:35,827 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:44:35,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:35,914 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:35,915 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 40 treesize of output 32 [2022-03-15 19:44:36,028 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:44:36,029 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803059518] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:36,029 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:36,029 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 18 [2022-03-15 19:44:36,029 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1615015663] [2022-03-15 19:44:36,029 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:36,032 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:36,040 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 52 transitions. [2022-03-15 19:44:36,040 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:37,415 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [16853#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~s~0 ~N~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~N~0 ~s~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 16855#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (<= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 16856#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (<= ~N~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< 1 ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (<= ~N~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< 1 ~N~0) (<= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0))), 16854#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (<= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 16852#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~s~0 ~N~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))))] [2022-03-15 19:44:37,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:44:37,415 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:37,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:44:37,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2022-03-15 19:44:37,416 INFO L87 Difference]: Start difference. First operand 244 states and 652 transitions. Second operand has 17 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:38,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:38,962 INFO L93 Difference]: Finished difference Result 373 states and 903 transitions. [2022-03-15 19:44:38,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 19:44:38,962 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 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 19:44:38,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:38,964 INFO L225 Difference]: With dead ends: 373 [2022-03-15 19:44:38,964 INFO L226 Difference]: Without dead ends: 359 [2022-03-15 19:44:38,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 34 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=277, Invalid=1363, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 19:44:38,965 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 80 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:38,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 34 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:44:38,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-03-15 19:44:38,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 246. [2022-03-15 19:44:38,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 2.673469387755102) internal successors, (655), 245 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:38,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 655 transitions. [2022-03-15 19:44:38,972 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 655 transitions. Word has length 20 [2022-03-15 19:44:38,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:38,972 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 655 transitions. [2022-03-15 19:44:38,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:38,973 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 655 transitions. [2022-03-15 19:44:38,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:44:38,973 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:38,973 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:38,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-03-15 19:44:39,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 19:44:39,187 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:39,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:39,188 INFO L85 PathProgramCache]: Analyzing trace with hash -457159785, now seen corresponding path program 16 times [2022-03-15 19:44:39,189 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:39,189 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208016049] [2022-03-15 19:44:39,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:39,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:39,818 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:39,818 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:39,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208016049] [2022-03-15 19:44:39,818 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208016049] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:39,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256367043] [2022-03-15 19:44:39,818 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:44:39,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:39,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:39,820 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:39,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-15 19:44:39,918 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:44:39,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:39,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-15 19:44:39,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:40,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:40,174 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:44:40,227 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-03-15 19:44:40,276 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:44:40,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:40,379 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1063 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1063) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))) (or (let ((.cse0 (+ c_~s~0 .cse1))) (and (<= .cse0 c_~N~0) (<= c_~N~0 .cse0))) (= .cse1 0)))) is different from false [2022-03-15 19:44:40,445 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:40,446 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 111 treesize of output 95 [2022-03-15 19:44:40,450 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 67 treesize of output 49 [2022-03-15 19:44:40,721 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:44:40,722 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256367043] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:40,722 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:40,722 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 7] total 27 [2022-03-15 19:44:40,722 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1517297703] [2022-03-15 19:44:40,722 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:40,724 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:40,728 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 38 transitions. [2022-03-15 19:44:40,728 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:41,365 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [17897#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (<= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 17898#(and (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)))] [2022-03-15 19:44:41,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:44:41,366 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:41,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:44:41,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=755, Unknown=1, NotChecked=56, Total=930 [2022-03-15 19:44:41,367 INFO L87 Difference]: Start difference. First operand 246 states and 655 transitions. Second operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:42,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:42,421 INFO L93 Difference]: Finished difference Result 286 states and 752 transitions. [2022-03-15 19:44:42,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 19:44:42,422 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 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 19:44:42,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:42,423 INFO L225 Difference]: With dead ends: 286 [2022-03-15 19:44:42,423 INFO L226 Difference]: Without dead ends: 267 [2022-03-15 19:44:42,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=182, Invalid=1227, Unknown=1, NotChecked=72, Total=1482 [2022-03-15 19:44:42,424 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 51 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:42,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 49 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:44:42,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-03-15 19:44:42,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 245. [2022-03-15 19:44:42,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 2.6557377049180326) internal successors, (648), 244 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:42,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 648 transitions. [2022-03-15 19:44:42,430 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 648 transitions. Word has length 20 [2022-03-15 19:44:42,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:42,430 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 648 transitions. [2022-03-15 19:44:42,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:42,431 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 648 transitions. [2022-03-15 19:44:42,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:44:42,431 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:42,431 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:42,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:42,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:42,632 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:42,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:42,633 INFO L85 PathProgramCache]: Analyzing trace with hash 176831309, now seen corresponding path program 17 times [2022-03-15 19:44:42,633 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:42,634 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679330725] [2022-03-15 19:44:42,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:42,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:43,172 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:43,173 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:43,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679330725] [2022-03-15 19:44:43,173 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679330725] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:43,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795405574] [2022-03-15 19:44:43,173 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:44:43,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:43,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:43,174 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:43,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-15 19:44:43,276 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:44:43,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:43,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 19:44:43,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:43,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:43,447 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:44:43,504 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:44:43,576 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:44:43,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:43,738 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:43,738 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 111 treesize of output 95 [2022-03-15 19:44:43,752 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 67 treesize of output 49 [2022-03-15 19:44:44,011 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:44:44,011 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795405574] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:44,011 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:44,011 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 7] total 26 [2022-03-15 19:44:44,011 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [618976049] [2022-03-15 19:44:44,011 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:44,013 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:44,017 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 32 transitions. [2022-03-15 19:44:44,017 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:44,518 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [18834#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (<= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 18835#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 18833#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (<= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))))] [2022-03-15 19:44:44,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:44:44,518 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:44,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:44:44,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=802, Unknown=3, NotChecked=0, Total=930 [2022-03-15 19:44:44,519 INFO L87 Difference]: Start difference. First operand 245 states and 648 transitions. Second operand has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:45,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:45,783 INFO L93 Difference]: Finished difference Result 310 states and 779 transitions. [2022-03-15 19:44:45,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 19:44:45,784 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 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 19:44:45,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:45,785 INFO L225 Difference]: With dead ends: 310 [2022-03-15 19:44:45,785 INFO L226 Difference]: Without dead ends: 301 [2022-03-15 19:44:45,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=229, Invalid=1574, Unknown=3, NotChecked=0, Total=1806 [2022-03-15 19:44:45,786 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 56 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:45,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 50 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:44:45,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-03-15 19:44:45,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 245. [2022-03-15 19:44:45,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 2.6557377049180326) internal successors, (648), 244 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:45,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 648 transitions. [2022-03-15 19:44:45,791 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 648 transitions. Word has length 20 [2022-03-15 19:44:45,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:45,792 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 648 transitions. [2022-03-15 19:44:45,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:45,792 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 648 transitions. [2022-03-15 19:44:45,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:44:45,793 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:45,793 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:45,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-03-15 19:44:46,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:46,017 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:46,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:46,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1533640094, now seen corresponding path program 11 times [2022-03-15 19:44:46,018 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:46,018 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349957874] [2022-03-15 19:44:46,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:46,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:46,351 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:46,351 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:46,351 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349957874] [2022-03-15 19:44:46,352 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349957874] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:46,352 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284833403] [2022-03-15 19:44:46,352 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:44:46,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:46,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:46,353 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:46,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-03-15 19:44:46,452 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:44:46,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:46,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 19:44:46,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:46,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:46,543 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:44:46,568 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 19:44:46,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:46,598 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1149 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1149) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) 0))) is different from false [2022-03-15 19:44:46,607 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:46,607 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 45 treesize of output 45 [2022-03-15 19:44:46,610 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 24 treesize of output 18 [2022-03-15 19:44:46,682 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-03-15 19:44:46,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284833403] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:46,682 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:44:46,682 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 6] total 20 [2022-03-15 19:44:46,682 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1715758348] [2022-03-15 19:44:46,682 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:46,684 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:46,688 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 28 transitions. [2022-03-15 19:44:46,688 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:46,704 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:44:46,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:44:46,704 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:46,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:44:46,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=322, Unknown=1, NotChecked=36, Total=420 [2022-03-15 19:44:46,705 INFO L87 Difference]: Start difference. First operand 245 states and 648 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:46,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:46,757 INFO L93 Difference]: Finished difference Result 257 states and 681 transitions. [2022-03-15 19:44:46,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:44:46,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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 19:44:46,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:46,759 INFO L225 Difference]: With dead ends: 257 [2022-03-15 19:44:46,759 INFO L226 Difference]: Without dead ends: 257 [2022-03-15 19:44:46,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=396, Unknown=1, NotChecked=40, Total=506 [2022-03-15 19:44:46,760 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 11 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:46,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 7 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 23 Unchecked, 0.0s Time] [2022-03-15 19:44:46,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-03-15 19:44:46,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 244. [2022-03-15 19:44:46,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 2.654320987654321) internal successors, (645), 243 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:46,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 645 transitions. [2022-03-15 19:44:46,765 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 645 transitions. Word has length 20 [2022-03-15 19:44:46,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:46,765 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 645 transitions. [2022-03-15 19:44:46,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:46,766 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 645 transitions. [2022-03-15 19:44:46,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:44:46,766 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:46,766 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:46,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:46,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:46,990 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:46,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:46,991 INFO L85 PathProgramCache]: Analyzing trace with hash -975422074, now seen corresponding path program 12 times [2022-03-15 19:44:46,991 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:46,991 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097708613] [2022-03-15 19:44:46,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:46,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:47,702 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:47,703 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:47,703 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097708613] [2022-03-15 19:44:47,703 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097708613] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:47,703 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936147230] [2022-03-15 19:44:47,703 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:44:47,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:47,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:47,705 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:47,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-03-15 19:44:47,809 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:44:47,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:47,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:44:47,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:47,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:47,895 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:44:47,917 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:44:47,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:47,947 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1196 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1196) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) 0))) is different from false [2022-03-15 19:44:47,957 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:47,957 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 45 treesize of output 45 [2022-03-15 19:44:47,961 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 24 treesize of output 18 [2022-03-15 19:44:48,043 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 1 not checked. [2022-03-15 19:44:48,044 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936147230] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:48,044 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:48,044 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 19 [2022-03-15 19:44:48,044 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [304383273] [2022-03-15 19:44:48,044 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:48,047 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:48,051 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 32 transitions. [2022-03-15 19:44:48,051 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:48,180 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [20678#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))] [2022-03-15 19:44:48,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:44:48,180 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:48,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:44:48,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=308, Unknown=1, NotChecked=36, Total=420 [2022-03-15 19:44:48,181 INFO L87 Difference]: Start difference. First operand 244 states and 645 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:48,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:48,736 INFO L93 Difference]: Finished difference Result 333 states and 852 transitions. [2022-03-15 19:44:48,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 19:44:48,736 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 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 19:44:48,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:48,738 INFO L225 Difference]: With dead ends: 333 [2022-03-15 19:44:48,738 INFO L226 Difference]: Without dead ends: 333 [2022-03-15 19:44:48,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=138, Invalid=567, Unknown=1, NotChecked=50, Total=756 [2022-03-15 19:44:48,738 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 59 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:48,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 28 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:44:48,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-03-15 19:44:48,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 250. [2022-03-15 19:44:48,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 2.6345381526104417) internal successors, (656), 249 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:48,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 656 transitions. [2022-03-15 19:44:48,745 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 656 transitions. Word has length 20 [2022-03-15 19:44:48,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:48,745 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 656 transitions. [2022-03-15 19:44:48,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:48,745 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 656 transitions. [2022-03-15 19:44:48,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:44:48,746 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:48,746 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:48,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-03-15 19:44:48,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-03-15 19:44:48,963 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:48,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:48,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1871718704, now seen corresponding path program 18 times [2022-03-15 19:44:48,964 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:48,964 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511107296] [2022-03-15 19:44:48,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:48,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:49,598 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:49,598 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:49,599 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511107296] [2022-03-15 19:44:49,599 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511107296] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:49,599 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879057202] [2022-03-15 19:44:49,599 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:44:49,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:49,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:49,604 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:49,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-03-15 19:44:49,737 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:44:49,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:49,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-15 19:44:49,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:50,165 INFO L353 Elim1Store]: treesize reduction 50, result has 5.7 percent of original size [2022-03-15 19:44:50,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 49 treesize of output 17 [2022-03-15 19:44:50,233 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:50,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:50,437 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-15 19:44:50,437 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 78 [2022-03-15 19:44:50,978 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:50,978 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879057202] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:50,979 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:50,979 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 34 [2022-03-15 19:44:50,979 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1064669718] [2022-03-15 19:44:50,979 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:50,981 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:50,987 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 61 transitions. [2022-03-15 19:44:50,988 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:52,505 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [21687#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (<= ~n~0 (+ 2 ~q_back~0))), 21685#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)), 21686#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0))), 21684#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)), 21683#(or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)), 21688#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 1) (< ~q_front~0 0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (<= ~n~0 (+ 2 ~q_back~0)) (< 2 ~N~0)), 21682#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))] [2022-03-15 19:44:52,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:44:52,505 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:52,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:44:52,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1553, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 19:44:52,506 INFO L87 Difference]: Start difference. First operand 250 states and 656 transitions. Second operand has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:54,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:54,549 INFO L93 Difference]: Finished difference Result 473 states and 1175 transitions. [2022-03-15 19:44:54,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 19:44:54,549 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 0 states have call successors, (0), 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 19:44:54,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:54,551 INFO L225 Difference]: With dead ends: 473 [2022-03-15 19:44:54,551 INFO L226 Difference]: Without dead ends: 447 [2022-03-15 19:44:54,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 24 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=416, Invalid=2776, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 19:44:54,552 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 122 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:54,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 78 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:44:54,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2022-03-15 19:44:54,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 298. [2022-03-15 19:44:54,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 2.734006734006734) internal successors, (812), 297 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:54,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 812 transitions. [2022-03-15 19:44:54,560 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 812 transitions. Word has length 21 [2022-03-15 19:44:54,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:54,560 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 812 transitions. [2022-03-15 19:44:54,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:54,560 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 812 transitions. [2022-03-15 19:44:54,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:44:54,561 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:54,561 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:54,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-03-15 19:44:54,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:54,786 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:54,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:54,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1678546094, now seen corresponding path program 19 times [2022-03-15 19:44:54,788 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:54,788 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148768738] [2022-03-15 19:44:54,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:54,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:55,315 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:55,316 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:55,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148768738] [2022-03-15 19:44:55,316 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148768738] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:55,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080810883] [2022-03-15 19:44:55,316 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:44:55,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:55,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:55,318 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:55,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-03-15 19:44:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:55,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 55 conjunts are in the unsatisfiable core [2022-03-15 19:44:55,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:55,758 INFO L353 Elim1Store]: treesize reduction 39, result has 23.5 percent of original size [2022-03-15 19:44:55,758 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 48 treesize of output 26 [2022-03-15 19:44:55,903 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:55,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:56,144 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-15 19:44:56,144 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 78 [2022-03-15 19:44:56,660 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:56,660 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080810883] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:56,660 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:56,660 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 33 [2022-03-15 19:44:56,660 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [197158126] [2022-03-15 19:44:56,660 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:56,663 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:56,670 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 57 transitions. [2022-03-15 19:44:56,670 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:58,906 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [22946#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ 2 ~q_back~0)))), 22947#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 1) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ 2 ~q_back~0)) (< 2 ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 1) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0)) (< 2 ~N~0))), 22945#(and (or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 22943#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 22941#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 22944#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 22942#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (< ~s~0 (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~N~0 ~s~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))))] [2022-03-15 19:44:58,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:44:58,907 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:58,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:44:58,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1450, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 19:44:58,908 INFO L87 Difference]: Start difference. First operand 298 states and 812 transitions. Second operand has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:05,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:05,455 INFO L93 Difference]: Finished difference Result 650 states and 1549 transitions. [2022-03-15 19:45:05,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 19:45:05,455 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:45:05,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:05,457 INFO L225 Difference]: With dead ends: 650 [2022-03-15 19:45:05,457 INFO L226 Difference]: Without dead ends: 627 [2022-03-15 19:45:05,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=637, Invalid=3919, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 19:45:05,458 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 216 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:05,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [216 Valid, 91 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:45:05,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2022-03-15 19:45:05,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 347. [2022-03-15 19:45:05,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 2.8121387283236996) internal successors, (973), 346 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 973 transitions. [2022-03-15 19:45:05,468 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 973 transitions. Word has length 21 [2022-03-15 19:45:05,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:05,468 INFO L470 AbstractCegarLoop]: Abstraction has 347 states and 973 transitions. [2022-03-15 19:45:05,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:05,469 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 973 transitions. [2022-03-15 19:45:05,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:45:05,470 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:05,470 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:05,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-03-15 19:45:05,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:05,684 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:05,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:05,684 INFO L85 PathProgramCache]: Analyzing trace with hash -785504444, now seen corresponding path program 20 times [2022-03-15 19:45:05,685 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:05,685 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681924324] [2022-03-15 19:45:05,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:05,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:06,116 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:06,116 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:06,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681924324] [2022-03-15 19:45:06,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681924324] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:06,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344961008] [2022-03-15 19:45:06,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:45:06,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:06,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:06,118 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:45:06,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-03-15 19:45:06,228 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:45:06,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:06,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 62 conjunts are in the unsatisfiable core [2022-03-15 19:45:06,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:06,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:45:06,598 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:45:06,598 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 14 [2022-03-15 19:45:06,644 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:06,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:06,813 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:45:06,813 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 78 [2022-03-15 19:45:07,119 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:07,119 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344961008] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:07,119 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:07,119 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 33 [2022-03-15 19:45:07,119 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1336909766] [2022-03-15 19:45:07,119 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:07,122 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:07,131 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 83 transitions. [2022-03-15 19:45:07,131 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:08,973 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [24505#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 1) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0)) (< 2 ~N~0)), 24504#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0))), 24500#(or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0)), 24499#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (= ~s~0 ~N~0)), 24503#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)), 24502#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)), 24501#(or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0)))] [2022-03-15 19:45:08,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:45:08,974 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:08,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:45:08,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=1388, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 19:45:08,975 INFO L87 Difference]: Start difference. First operand 347 states and 973 transitions. Second operand has 21 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:11,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:11,686 INFO L93 Difference]: Finished difference Result 523 states and 1360 transitions. [2022-03-15 19:45:11,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 19:45:11,687 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:45:11,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:11,689 INFO L225 Difference]: With dead ends: 523 [2022-03-15 19:45:11,689 INFO L226 Difference]: Without dead ends: 504 [2022-03-15 19:45:11,689 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 33 SyntacticMatches, 8 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1463 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=796, Invalid=3110, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 19:45:11,689 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 152 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:11,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 78 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:45:11,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-03-15 19:45:11,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 396. [2022-03-15 19:45:11,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 2.8227848101265822) internal successors, (1115), 395 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:11,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1115 transitions. [2022-03-15 19:45:11,698 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1115 transitions. Word has length 21 [2022-03-15 19:45:11,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:11,698 INFO L470 AbstractCegarLoop]: Abstraction has 396 states and 1115 transitions. [2022-03-15 19:45:11,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:11,699 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1115 transitions. [2022-03-15 19:45:11,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:45:11,700 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:11,700 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:11,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-03-15 19:45:11,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-03-15 19:45:11,915 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:11,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:11,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1898521894, now seen corresponding path program 21 times [2022-03-15 19:45:11,916 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:11,917 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385991459] [2022-03-15 19:45:11,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:11,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:12,332 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:12,332 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:12,332 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385991459] [2022-03-15 19:45:12,332 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385991459] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:12,332 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734236461] [2022-03-15 19:45:12,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:45:12,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:12,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:12,333 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:45:12,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-03-15 19:45:12,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:45:12,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:12,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-15 19:45:12,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:12,647 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:45:12,648 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 14 [2022-03-15 19:45:12,693 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:45:12,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:12,836 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:45:12,837 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 78 [2022-03-15 19:45:12,941 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:45:12,942 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734236461] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:12,942 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:12,942 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 24 [2022-03-15 19:45:12,942 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1971178761] [2022-03-15 19:45:12,942 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:12,945 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:12,953 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 68 transitions. [2022-03-15 19:45:12,953 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:14,540 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [26014#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0))), 26015#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 1) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0)) (< 2 ~N~0)), 26009#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (= ~s~0 ~N~0)), 26010#(or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0)), 26013#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)), 26011#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0)), 26012#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))] [2022-03-15 19:45:14,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:45:14,540 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:14,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:45:14,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=886, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 19:45:14,541 INFO L87 Difference]: Start difference. First operand 396 states and 1115 transitions. Second operand has 21 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:17,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:17,962 INFO L93 Difference]: Finished difference Result 540 states and 1366 transitions. [2022-03-15 19:45:17,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 19:45:17,963 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:45:17,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:17,965 INFO L225 Difference]: With dead ends: 540 [2022-03-15 19:45:17,965 INFO L226 Difference]: Without dead ends: 514 [2022-03-15 19:45:17,965 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 35 SyntacticMatches, 8 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=610, Invalid=2812, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 19:45:17,965 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 152 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:17,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 80 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:45:17,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2022-03-15 19:45:17,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 400. [2022-03-15 19:45:17,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 2.819548872180451) internal successors, (1125), 399 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:17,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1125 transitions. [2022-03-15 19:45:17,973 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1125 transitions. Word has length 21 [2022-03-15 19:45:17,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:17,974 INFO L470 AbstractCegarLoop]: Abstraction has 400 states and 1125 transitions. [2022-03-15 19:45:17,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:17,974 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1125 transitions. [2022-03-15 19:45:17,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:45:17,975 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:17,975 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:18,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-03-15 19:45:18,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-03-15 19:45:18,195 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:18,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:18,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1153819396, now seen corresponding path program 22 times [2022-03-15 19:45:18,196 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:18,197 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025378555] [2022-03-15 19:45:18,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:18,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:18,592 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:18,592 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:18,592 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025378555] [2022-03-15 19:45:18,592 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025378555] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:18,592 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087678818] [2022-03-15 19:45:18,592 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:45:18,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:18,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:18,593 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:45:18,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-03-15 19:45:18,726 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:45:18,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:18,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-15 19:45:18,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:19,047 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:45:19,047 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 22 [2022-03-15 19:45:19,169 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:19,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:19,494 INFO L353 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2022-03-15 19:45:19,495 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 89 treesize of output 67 [2022-03-15 19:45:19,936 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:19,936 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087678818] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:19,936 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:19,936 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2022-03-15 19:45:19,936 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [129188538] [2022-03-15 19:45:19,936 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:19,939 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:19,946 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 64 transitions. [2022-03-15 19:45:19,946 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:22,472 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [27570#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0)))), 27565#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 27566#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 27567#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 27568#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)) (or (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 27569#(and (or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 27571#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 1) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0)) (< 2 ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 1) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0)) (< 2 ~N~0)))] [2022-03-15 19:45:22,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:45:22,473 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:22,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:45:22,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=1541, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 19:45:22,474 INFO L87 Difference]: Start difference. First operand 400 states and 1125 transitions. Second operand has 21 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:27,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:27,675 INFO L93 Difference]: Finished difference Result 789 states and 1930 transitions. [2022-03-15 19:45:27,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-15 19:45:27,676 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 20 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 21 [2022-03-15 19:45:27,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:27,678 INFO L225 Difference]: With dead ends: 789 [2022-03-15 19:45:27,678 INFO L226 Difference]: Without dead ends: 755 [2022-03-15 19:45:27,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 22 SyntacticMatches, 8 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1261 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=918, Invalid=4484, Unknown=0, NotChecked=0, Total=5402 [2022-03-15 19:45:27,679 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 200 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:27,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 66 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:45:27,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2022-03-15 19:45:27,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 432. [2022-03-15 19:45:27,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 431 states have (on average 2.8352668213457077) internal successors, (1222), 431 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:27,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1222 transitions. [2022-03-15 19:45:27,690 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 1222 transitions. Word has length 21 [2022-03-15 19:45:27,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:27,690 INFO L470 AbstractCegarLoop]: Abstraction has 432 states and 1222 transitions. [2022-03-15 19:45:27,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:27,690 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 1222 transitions. [2022-03-15 19:45:27,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:45:27,691 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:27,692 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:27,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-03-15 19:45:27,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-03-15 19:45:27,915 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:27,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:27,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1335451210, now seen corresponding path program 23 times [2022-03-15 19:45:27,916 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:27,916 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436130301] [2022-03-15 19:45:27,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:27,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:28,418 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:28,418 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:28,418 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436130301] [2022-03-15 19:45:28,418 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436130301] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:28,418 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709687143] [2022-03-15 19:45:28,418 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:45:28,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:28,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:28,420 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:45:28,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-03-15 19:45:28,532 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:45:28,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:28,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 66 conjunts are in the unsatisfiable core [2022-03-15 19:45:28,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:28,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:45:28,901 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 29 treesize of output 29 [2022-03-15 19:45:29,061 INFO L353 Elim1Store]: treesize reduction 50, result has 5.7 percent of original size [2022-03-15 19:45:29,062 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 49 treesize of output 17 [2022-03-15 19:45:29,123 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:29,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:29,196 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1425 (Array Int Int))) (= c_~N~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1425) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse0 (+ .cse1 c_~q~0.offset 4)) (select .cse0 (+ .cse1 c_~q~0.offset)))))) is different from false [2022-03-15 19:45:29,258 WARN L838 $PredicateComparison]: unable to prove that (or (not (= (select (select |c_#memory_int| c_~q~0.base) (+ c_~q~0.offset (* 4 c_~q_back~0))) 1)) (and (forall ((v_ArrVal_1425 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1425) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse0 (+ .cse1 c_~q~0.offset 4)) (select .cse0 (+ .cse1 c_~q~0.offset)))) (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1))) (forall ((v_ArrVal_1425 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1425) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse2 (+ .cse3 c_~q~0.offset 4)) (select .cse2 (+ .cse3 c_~q~0.offset))))))) (<= c_~n~0 0) (<= c_~n~0 (+ c_~q_back~0 1))) is different from false [2022-03-15 19:45:29,302 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-15 19:45:29,302 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 140 [2022-03-15 19:45:29,309 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:45:29,310 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 66 [2022-03-15 19:45:29,316 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:45:29,316 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 53 [2022-03-15 19:45:29,890 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-15 19:45:29,891 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709687143] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:29,891 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:29,891 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 36 [2022-03-15 19:45:29,891 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2112387255] [2022-03-15 19:45:29,891 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:29,893 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:29,898 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 45 transitions. [2022-03-15 19:45:29,898 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:30,450 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [29444#(or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0)), 29443#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (= ~s~0 ~N~0)), 29445#(or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0)))] [2022-03-15 19:45:30,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:45:30,451 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:30,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:45:30,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1266, Unknown=2, NotChecked=150, Total=1640 [2022-03-15 19:45:30,451 INFO L87 Difference]: Start difference. First operand 432 states and 1222 transitions. Second operand has 18 states, 17 states have (on average 2.0) internal successors, (34), 17 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 19:45:31,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:31,237 INFO L93 Difference]: Finished difference Result 549 states and 1496 transitions. [2022-03-15 19:45:31,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:45:31,237 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 17 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 21 [2022-03-15 19:45:31,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:31,239 INFO L225 Difference]: With dead ends: 549 [2022-03-15 19:45:31,239 INFO L226 Difference]: Without dead ends: 535 [2022-03-15 19:45:31,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=343, Invalid=1733, Unknown=2, NotChecked=178, Total=2256 [2022-03-15 19:45:31,240 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 72 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:31,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 59 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:45:31,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-03-15 19:45:31,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 440. [2022-03-15 19:45:31,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 2.8200455580865604) internal successors, (1238), 439 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:31,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1238 transitions. [2022-03-15 19:45:31,248 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1238 transitions. Word has length 21 [2022-03-15 19:45:31,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:31,248 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 1238 transitions. [2022-03-15 19:45:31,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 17 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 19:45:31,248 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1238 transitions. [2022-03-15 19:45:31,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:45:31,249 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:31,249 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:31,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-03-15 19:45:31,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-03-15 19:45:31,467 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:31,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:31,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1138403520, now seen corresponding path program 24 times [2022-03-15 19:45:31,468 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:31,469 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089906426] [2022-03-15 19:45:31,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:31,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:32,004 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:32,004 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:32,004 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089906426] [2022-03-15 19:45:32,004 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089906426] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:32,004 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471016774] [2022-03-15 19:45:32,004 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:45:32,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:32,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:32,008 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:45:32,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-03-15 19:45:32,170 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:45:32,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:32,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 60 conjunts are in the unsatisfiable core [2022-03-15 19:45:32,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:32,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:45:32,478 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 29 treesize of output 29 [2022-03-15 19:45:32,707 INFO L353 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-03-15 19:45:32,708 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 48 treesize of output 17 [2022-03-15 19:45:32,776 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:32,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:32,979 WARN L838 $PredicateComparison]: unable to prove that (or (not (= (select (select |c_#memory_int| c_~q~0.base) (+ c_~q~0.offset (* 4 c_~q_back~0))) 1)) (<= c_~n~0 0) (and (forall ((v_ArrVal_1464 (Array Int Int))) (<= (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1464) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse0 (+ .cse1 c_~q~0.offset 4)) (select .cse0 (+ .cse1 c_~q~0.offset)))))) (forall ((v_ArrVal_1464 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1464) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse2 (+ .cse3 c_~q~0.offset 4)) (select .cse2 (+ .cse3 c_~q~0.offset)))) (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1)))) (<= c_~n~0 (+ c_~q_back~0 1))) is different from false [2022-03-15 19:45:33,025 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-15 19:45:33,025 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 140 [2022-03-15 19:45:33,033 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:45:33,033 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 66 [2022-03-15 19:45:33,042 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:45:33,043 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 53 [2022-03-15 19:45:33,646 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-15 19:45:33,647 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471016774] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:33,647 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:33,647 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 36 [2022-03-15 19:45:33,647 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [63171635] [2022-03-15 19:45:33,647 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:33,649 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:33,654 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 39 transitions. [2022-03-15 19:45:33,654 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:34,111 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [31048#(or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0)), 31047#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (= ~s~0 ~N~0)), 31050#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)), 31049#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0))] [2022-03-15 19:45:34,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:45:34,112 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:34,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:45:34,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1380, Unknown=5, NotChecked=78, Total=1722 [2022-03-15 19:45:34,112 INFO L87 Difference]: Start difference. First operand 440 states and 1238 transitions. Second operand has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 19:45:35,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:35,639 INFO L93 Difference]: Finished difference Result 509 states and 1361 transitions. [2022-03-15 19:45:35,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 19:45:35,640 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 21 [2022-03-15 19:45:35,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:35,642 INFO L225 Difference]: With dead ends: 509 [2022-03-15 19:45:35,642 INFO L226 Difference]: Without dead ends: 496 [2022-03-15 19:45:35,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=528, Invalid=2663, Unknown=5, NotChecked=110, Total=3306 [2022-03-15 19:45:35,642 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 99 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:35,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 77 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:45:35,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-03-15 19:45:35,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 440. [2022-03-15 19:45:35,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 2.8109339407744875) internal successors, (1234), 439 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:35,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1234 transitions. [2022-03-15 19:45:35,651 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1234 transitions. Word has length 21 [2022-03-15 19:45:35,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:35,651 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 1234 transitions. [2022-03-15 19:45:35,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 19:45:35,651 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1234 transitions. [2022-03-15 19:45:35,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:45:35,652 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:35,652 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:35,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-03-15 19:45:35,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-03-15 19:45:35,867 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:35,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:35,868 INFO L85 PathProgramCache]: Analyzing trace with hash 393701022, now seen corresponding path program 25 times [2022-03-15 19:45:35,868 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:35,868 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571838685] [2022-03-15 19:45:35,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:35,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:36,370 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:36,370 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:36,370 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571838685] [2022-03-15 19:45:36,370 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571838685] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:36,370 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560122857] [2022-03-15 19:45:36,370 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:45:36,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:36,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:36,372 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:45:36,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-03-15 19:45:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:36,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 66 conjunts are in the unsatisfiable core [2022-03-15 19:45:36,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:36,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:45:36,793 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-03-15 19:45:36,936 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:45:36,936 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 50 treesize of output 14 [2022-03-15 19:45:37,035 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:37,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:37,366 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:45:37,366 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 140 [2022-03-15 19:45:37,372 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:45:37,372 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 66 [2022-03-15 19:45:37,378 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:45:37,378 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 53 [2022-03-15 19:45:37,803 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:37,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560122857] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:37,803 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:37,803 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 36 [2022-03-15 19:45:37,803 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [891374960] [2022-03-15 19:45:37,803 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:37,805 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:37,809 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 35 transitions. [2022-03-15 19:45:37,810 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:38,212 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [32630#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 32632#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)), 32631#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 32633#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)))] [2022-03-15 19:45:38,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:45:38,213 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:38,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:45:38,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1448, Unknown=4, NotChecked=0, Total=1722 [2022-03-15 19:45:38,213 INFO L87 Difference]: Start difference. First operand 440 states and 1234 transitions. Second operand has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 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 19:45:39,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:39,679 INFO L93 Difference]: Finished difference Result 599 states and 1566 transitions. [2022-03-15 19:45:39,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 19:45:39,680 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 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 21 [2022-03-15 19:45:39,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:39,682 INFO L225 Difference]: With dead ends: 599 [2022-03-15 19:45:39,682 INFO L226 Difference]: Without dead ends: 585 [2022-03-15 19:45:39,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=492, Invalid=2696, Unknown=4, NotChecked=0, Total=3192 [2022-03-15 19:45:39,682 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 139 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:39,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 76 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:45:39,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2022-03-15 19:45:39,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 440. [2022-03-15 19:45:39,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 2.7790432801822322) internal successors, (1220), 439 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:39,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1220 transitions. [2022-03-15 19:45:39,689 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1220 transitions. Word has length 21 [2022-03-15 19:45:39,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:39,689 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 1220 transitions. [2022-03-15 19:45:39,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 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 19:45:39,689 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1220 transitions. [2022-03-15 19:45:39,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:45:39,690 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:39,690 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:39,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-03-15 19:45:39,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-03-15 19:45:39,891 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:39,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:39,891 INFO L85 PathProgramCache]: Analyzing trace with hash 24114678, now seen corresponding path program 26 times [2022-03-15 19:45:39,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:39,892 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016419041] [2022-03-15 19:45:39,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:39,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:40,456 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:40,456 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:40,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016419041] [2022-03-15 19:45:40,456 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016419041] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:40,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533477107] [2022-03-15 19:45:40,456 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:45:40,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:40,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:40,460 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:45:40,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-03-15 19:45:40,586 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:45:40,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:40,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 19:45:40,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:40,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:45:40,824 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:45:41,062 INFO L353 Elim1Store]: treesize reduction 50, result has 5.7 percent of original size [2022-03-15 19:45:41,063 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 49 treesize of output 17 [2022-03-15 19:45:41,117 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:41,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:41,456 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-15 19:45:41,456 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 158 treesize of output 160 [2022-03-15 19:45:41,482 INFO L353 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2022-03-15 19:45:41,482 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 104 treesize of output 98 [2022-03-15 19:45:42,269 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:42,269 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533477107] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:42,269 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:42,270 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 36 [2022-03-15 19:45:42,270 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [133655463] [2022-03-15 19:45:42,270 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:42,272 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:42,276 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 41 transitions. [2022-03-15 19:45:42,277 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:43,361 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [34301#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 34304#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 34305#(and (or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 34303#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 34302#(and (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1))))] [2022-03-15 19:45:43,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:45:43,362 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:43,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:45:43,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1535, Unknown=6, NotChecked=0, Total=1806 [2022-03-15 19:45:43,362 INFO L87 Difference]: Start difference. First operand 440 states and 1220 transitions. Second operand has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 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 19:45:46,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:46,640 INFO L93 Difference]: Finished difference Result 637 states and 1604 transitions. [2022-03-15 19:45:46,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 19:45:46,641 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 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 21 [2022-03-15 19:45:46,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:46,643 INFO L225 Difference]: With dead ends: 637 [2022-03-15 19:45:46,643 INFO L226 Difference]: Without dead ends: 611 [2022-03-15 19:45:46,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=545, Invalid=3231, Unknown=6, NotChecked=0, Total=3782 [2022-03-15 19:45:46,644 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 168 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:46,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 75 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:45:46,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-03-15 19:45:46,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 446. [2022-03-15 19:45:46,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 2.761797752808989) internal successors, (1229), 445 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:46,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1229 transitions. [2022-03-15 19:45:46,652 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1229 transitions. Word has length 21 [2022-03-15 19:45:46,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:46,652 INFO L470 AbstractCegarLoop]: Abstraction has 446 states and 1229 transitions. [2022-03-15 19:45:46,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 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 19:45:46,652 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1229 transitions. [2022-03-15 19:45:46,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:45:46,653 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:46,653 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:46,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-03-15 19:45:46,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-03-15 19:45:46,867 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:46,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:46,868 INFO L85 PathProgramCache]: Analyzing trace with hash -720587820, now seen corresponding path program 27 times [2022-03-15 19:45:46,868 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:46,869 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892341596] [2022-03-15 19:45:46,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:46,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:47,435 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:47,436 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:47,436 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892341596] [2022-03-15 19:45:47,436 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892341596] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:47,436 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115733672] [2022-03-15 19:45:47,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:45:47,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:47,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:47,437 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:45:47,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-03-15 19:45:47,681 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:45:47,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:47,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 58 conjunts are in the unsatisfiable core [2022-03-15 19:45:47,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:47,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:45:47,853 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:45:47,990 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:45:47,991 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 22 [2022-03-15 19:45:48,101 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:45:48,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:48,311 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1581 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1581) c_~q~0.base)) (.cse4 (* c_~q_front~0 4))) (let ((.cse2 (select .cse3 (+ .cse4 c_~q~0.offset 4)))) (or (let ((.cse1 (+ c_~s~0 .cse2 (select .cse3 (+ .cse4 c_~q~0.offset)))) (.cse0 (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (= (select .cse3 (+ c_~q~0.offset (* 4 c_~q_back~0))) 1)) (= .cse2 0))))) is different from false [2022-03-15 19:45:48,347 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:45:48,348 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 191 treesize of output 183 [2022-03-15 19:45:48,366 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:45:48,366 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 119 treesize of output 105 [2022-03-15 19:45:48,801 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:45:48,802 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115733672] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:48,802 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:48,802 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9] total 32 [2022-03-15 19:45:48,802 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1251742994] [2022-03-15 19:45:48,802 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:48,804 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:48,808 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 37 transitions. [2022-03-15 19:45:48,808 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:49,399 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [36030#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0)), 36029#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0)), 36027#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (= ~s~0 ~N~0)), 36031#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)), 36028#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (= ~s~0 ~N~0))] [2022-03-15 19:45:49,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:45:49,400 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:49,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:45:49,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1228, Unknown=1, NotChecked=72, Total=1482 [2022-03-15 19:45:49,401 INFO L87 Difference]: Start difference. First operand 446 states and 1229 transitions. Second operand has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 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 19:45:51,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:51,571 INFO L93 Difference]: Finished difference Result 655 states and 1632 transitions. [2022-03-15 19:45:51,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 19:45:51,571 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 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 21 [2022-03-15 19:45:51,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:51,573 INFO L225 Difference]: With dead ends: 655 [2022-03-15 19:45:51,573 INFO L226 Difference]: Without dead ends: 637 [2022-03-15 19:45:51,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=400, Invalid=2795, Unknown=1, NotChecked=110, Total=3306 [2022-03-15 19:45:51,574 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 215 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:51,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 77 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:45:51,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2022-03-15 19:45:51,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 438. [2022-03-15 19:45:51,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 437 states have (on average 2.7620137299771166) internal successors, (1207), 437 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:51,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1207 transitions. [2022-03-15 19:45:51,582 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1207 transitions. Word has length 21 [2022-03-15 19:45:51,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:51,583 INFO L470 AbstractCegarLoop]: Abstraction has 438 states and 1207 transitions. [2022-03-15 19:45:51,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 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 19:45:51,583 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1207 transitions. [2022-03-15 19:45:51,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:45:51,584 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:51,584 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:51,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-03-15 19:45:51,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-03-15 19:45:51,794 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:51,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:51,794 INFO L85 PathProgramCache]: Analyzing trace with hash -327474703, now seen corresponding path program 28 times [2022-03-15 19:45:51,795 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:51,795 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889909508] [2022-03-15 19:45:51,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:51,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:52,076 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:52,077 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:52,077 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889909508] [2022-03-15 19:45:52,077 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889909508] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:52,077 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984660853] [2022-03-15 19:45:52,077 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:45:52,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:52,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:52,078 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:45:52,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-03-15 19:45:52,202 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:45:52,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:52,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 19:45:52,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:52,305 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:45:52,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:52,334 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-03-15 19:45:52,335 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 25 treesize of output 16 [2022-03-15 19:45:52,376 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-03-15 19:45:52,379 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984660853] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:52,379 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:52,379 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 4] total 17 [2022-03-15 19:45:52,379 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1136504034] [2022-03-15 19:45:52,380 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:52,382 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:52,390 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 55 transitions. [2022-03-15 19:45:52,390 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:53,022 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [37742#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)), 37739#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 37743#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0))), 37740#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 37741#(or (<= (+ 2 ~q_back~0) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))] [2022-03-15 19:45:53,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:45:53,023 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:53,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:45:53,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2022-03-15 19:45:53,023 INFO L87 Difference]: Start difference. First operand 438 states and 1207 transitions. Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:53,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:53,841 INFO L93 Difference]: Finished difference Result 592 states and 1568 transitions. [2022-03-15 19:45:53,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 19:45:53,841 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 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 19:45:53,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:53,843 INFO L225 Difference]: With dead ends: 592 [2022-03-15 19:45:53,843 INFO L226 Difference]: Without dead ends: 592 [2022-03-15 19:45:53,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=315, Invalid=1167, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:45:53,844 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 90 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:53,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 40 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:45:53,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-03-15 19:45:53,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 466. [2022-03-15 19:45:53,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 465 states have (on average 2.821505376344086) internal successors, (1312), 465 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:53,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 1312 transitions. [2022-03-15 19:45:53,853 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 1312 transitions. Word has length 21 [2022-03-15 19:45:53,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:53,853 INFO L470 AbstractCegarLoop]: Abstraction has 466 states and 1312 transitions. [2022-03-15 19:45:53,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:53,853 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 1312 transitions. [2022-03-15 19:45:53,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:45:53,854 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:53,854 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:53,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-03-15 19:45:54,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:54,067 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:54,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:54,068 INFO L85 PathProgramCache]: Analyzing trace with hash 528426597, now seen corresponding path program 29 times [2022-03-15 19:45:54,068 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:54,068 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515974683] [2022-03-15 19:45:54,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:54,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:54,606 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:54,606 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:54,606 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515974683] [2022-03-15 19:45:54,606 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515974683] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:54,606 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245093101] [2022-03-15 19:45:54,607 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:45:54,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:54,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:54,608 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:45:54,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-03-15 19:45:54,741 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:45:54,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:54,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 19:45:54,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-03-15 19:45:54,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:54,861 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-03-15 19:45:54,861 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 25 treesize of output 16 [2022-03-15 19:45:54,900 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-03-15 19:45:54,900 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245093101] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:54,901 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:54,901 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4, 4] total 16 [2022-03-15 19:45:54,901 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1385534451] [2022-03-15 19:45:54,901 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:54,903 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:54,908 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 51 transitions. [2022-03-15 19:45:54,909 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:55,895 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [39440#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)), 39438#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 39439#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 39437#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= ~n~0 ~q_back~0) (< ~q_back~0 0)), 39441#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0))), 39442#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 1) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0)) (< 2 ~N~0))] [2022-03-15 19:45:55,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:45:55,895 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:55,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:45:55,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2022-03-15 19:45:55,896 INFO L87 Difference]: Start difference. First operand 466 states and 1312 transitions. Second operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:57,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:57,720 INFO L93 Difference]: Finished difference Result 617 states and 1632 transitions. [2022-03-15 19:45:57,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 19:45:57,720 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 18 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 21 [2022-03-15 19:45:57,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:57,722 INFO L225 Difference]: With dead ends: 617 [2022-03-15 19:45:57,722 INFO L226 Difference]: Without dead ends: 615 [2022-03-15 19:45:57,723 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=342, Invalid=1638, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:45:57,723 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 114 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:57,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 44 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:45:57,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-03-15 19:45:57,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 490. [2022-03-15 19:45:57,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 489 states have (on average 2.8588957055214723) internal successors, (1398), 489 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:57,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1398 transitions. [2022-03-15 19:45:57,732 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1398 transitions. Word has length 21 [2022-03-15 19:45:57,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:57,732 INFO L470 AbstractCegarLoop]: Abstraction has 490 states and 1398 transitions. [2022-03-15 19:45:57,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:57,732 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1398 transitions. [2022-03-15 19:45:57,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:45:57,733 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:57,733 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:57,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-03-15 19:45:57,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:57,953 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:57,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:57,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1982352049, now seen corresponding path program 30 times [2022-03-15 19:45:57,954 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:57,954 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353208826] [2022-03-15 19:45:57,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:57,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:58,303 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:58,303 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:58,303 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353208826] [2022-03-15 19:45:58,303 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353208826] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:58,303 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061733539] [2022-03-15 19:45:58,303 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:45:58,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:58,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:58,304 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:45:58,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-03-15 19:45:58,430 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:45:58,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:58,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 19:45:58,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:58,539 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:45:58,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:58,594 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-03-15 19:45:58,595 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 26 treesize of output 18 [2022-03-15 19:45:58,635 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:45:58,636 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061733539] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:58,636 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:58,636 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 5] total 18 [2022-03-15 19:45:58,636 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2118279663] [2022-03-15 19:45:58,636 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:58,638 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:58,644 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 58 transitions. [2022-03-15 19:45:58,644 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:59,294 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [41226#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)), 41225#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)), 41223#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= ~n~0 ~q_back~0) (< ~q_back~0 0)), 41224#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 41227#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0)))] [2022-03-15 19:45:59,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:45:59,294 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:59,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:45:59,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2022-03-15 19:45:59,295 INFO L87 Difference]: Start difference. First operand 490 states and 1398 transitions. Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:00,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:00,393 INFO L93 Difference]: Finished difference Result 580 states and 1579 transitions. [2022-03-15 19:46:00,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 19:46:00,393 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 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 21 [2022-03-15 19:46:00,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:00,395 INFO L225 Difference]: With dead ends: 580 [2022-03-15 19:46:00,395 INFO L226 Difference]: Without dead ends: 576 [2022-03-15 19:46:00,395 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=202, Invalid=988, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:46:00,396 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 99 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:00,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 50 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:46:00,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2022-03-15 19:46:00,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 485. [2022-03-15 19:46:00,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 2.8388429752066116) internal successors, (1374), 484 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:00,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 1374 transitions. [2022-03-15 19:46:00,405 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 1374 transitions. Word has length 21 [2022-03-15 19:46:00,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:00,405 INFO L470 AbstractCegarLoop]: Abstraction has 485 states and 1374 transitions. [2022-03-15 19:46:00,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:00,406 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 1374 transitions. [2022-03-15 19:46:00,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:46:00,407 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:00,407 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:00,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-03-15 19:46:00,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-03-15 19:46:00,611 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:00,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:00,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1834196405, now seen corresponding path program 31 times [2022-03-15 19:46:00,612 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:00,612 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978060039] [2022-03-15 19:46:00,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:00,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:00,955 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:00,956 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:00,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978060039] [2022-03-15 19:46:00,956 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978060039] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:00,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481799597] [2022-03-15 19:46:00,956 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:46:00,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:00,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:00,957 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:00,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-03-15 19:46:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:01,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 19:46:01,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:01,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:46:01,228 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:46:01,270 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:46:01,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:01,320 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1750 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1750) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset 4)) 0))) is different from false [2022-03-15 19:46:01,332 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:46:01,333 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 47 treesize of output 47 [2022-03-15 19:46:01,336 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 25 treesize of output 18 [2022-03-15 19:46:01,448 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 2 not checked. [2022-03-15 19:46:01,449 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481799597] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:01,449 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:01,449 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 7] total 26 [2022-03-15 19:46:01,449 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [708311775] [2022-03-15 19:46:01,449 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:01,451 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:01,455 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 39 transitions. [2022-03-15 19:46:01,455 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:01,714 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [42948#(or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)), 42947#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))] [2022-03-15 19:46:01,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:46:01,714 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:01,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:46:01,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=644, Unknown=1, NotChecked=52, Total=812 [2022-03-15 19:46:01,715 INFO L87 Difference]: Start difference. First operand 485 states and 1374 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:02,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:02,313 INFO L93 Difference]: Finished difference Result 587 states and 1652 transitions. [2022-03-15 19:46:02,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 19:46:02,313 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:46:02,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:02,316 INFO L225 Difference]: With dead ends: 587 [2022-03-15 19:46:02,316 INFO L226 Difference]: Without dead ends: 587 [2022-03-15 19:46:02,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=183, Invalid=1080, Unknown=1, NotChecked=68, Total=1332 [2022-03-15 19:46:02,316 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 63 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:02,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 46 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:46:02,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-03-15 19:46:02,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 498. [2022-03-15 19:46:02,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 497 states have (on average 2.8490945674044266) internal successors, (1416), 497 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:02,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 1416 transitions. [2022-03-15 19:46:02,325 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 1416 transitions. Word has length 21 [2022-03-15 19:46:02,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:02,326 INFO L470 AbstractCegarLoop]: Abstraction has 498 states and 1416 transitions. [2022-03-15 19:46:02,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:02,326 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 1416 transitions. [2022-03-15 19:46:02,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:46:02,327 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:02,327 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:02,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-03-15 19:46:02,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-03-15 19:46:02,543 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:02,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:02,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1200205311, now seen corresponding path program 32 times [2022-03-15 19:46:02,544 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:02,544 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799421305] [2022-03-15 19:46:02,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:02,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:02,938 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:02,938 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:02,938 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799421305] [2022-03-15 19:46:02,939 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799421305] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:02,939 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803034067] [2022-03-15 19:46:02,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:46:02,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:02,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:02,944 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:02,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-03-15 19:46:03,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:46:03,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:03,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 19:46:03,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:03,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:46:03,229 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:46:03,270 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:46:03,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:03,316 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1793 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1793) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset 4)) 0))) is different from false [2022-03-15 19:46:03,324 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:46:03,324 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 47 treesize of output 47 [2022-03-15 19:46:03,326 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 25 treesize of output 18 [2022-03-15 19:46:03,425 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:46:03,425 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803034067] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:03,425 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:03,426 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 24 [2022-03-15 19:46:03,426 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1242229960] [2022-03-15 19:46:03,426 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:03,428 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:03,432 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 33 transitions. [2022-03-15 19:46:03,432 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:03,639 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [44693#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 44694#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 44695#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))] [2022-03-15 19:46:03,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:46:03,640 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:03,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:46:03,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=605, Unknown=1, NotChecked=50, Total=756 [2022-03-15 19:46:03,640 INFO L87 Difference]: Start difference. First operand 498 states and 1416 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:04,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:04,023 INFO L93 Difference]: Finished difference Result 554 states and 1531 transitions. [2022-03-15 19:46:04,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:46:04,024 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:46:04,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:04,026 INFO L225 Difference]: With dead ends: 554 [2022-03-15 19:46:04,026 INFO L226 Difference]: Without dead ends: 554 [2022-03-15 19:46:04,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=806, Unknown=1, NotChecked=58, Total=992 [2022-03-15 19:46:04,026 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 42 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:04,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 37 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:46:04,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2022-03-15 19:46:04,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 477. [2022-03-15 19:46:04,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 2.8340336134453783) internal successors, (1349), 476 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:04,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1349 transitions. [2022-03-15 19:46:04,033 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 1349 transitions. Word has length 21 [2022-03-15 19:46:04,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:04,033 INFO L470 AbstractCegarLoop]: Abstraction has 477 states and 1349 transitions. [2022-03-15 19:46:04,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:04,033 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 1349 transitions. [2022-03-15 19:46:04,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:46:04,034 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:04,034 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:04,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2022-03-15 19:46:04,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-03-15 19:46:04,235 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:04,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:04,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1034874357, now seen corresponding path program 33 times [2022-03-15 19:46:04,236 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:04,236 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323754075] [2022-03-15 19:46:04,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:04,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:04,815 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:04,815 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:04,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323754075] [2022-03-15 19:46:04,815 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323754075] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:04,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178390551] [2022-03-15 19:46:04,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:46:04,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:04,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:04,820 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:04,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-03-15 19:46:04,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:46:04,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:04,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 19:46:04,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:05,084 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:46:05,134 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:46:05,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:05,217 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:46:05,217 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 42 treesize of output 34 [2022-03-15 19:46:05,302 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:46:05,303 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178390551] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:05,303 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:05,303 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 20 [2022-03-15 19:46:05,303 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [63739671] [2022-03-15 19:46:05,303 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:05,305 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:05,311 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 68 transitions. [2022-03-15 19:46:05,311 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:06,876 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [46355#(and (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0))), 46358#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (<= ~N~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< 1 ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (<= ~N~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< 1 ~N~0))), 46356#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 46357#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 46354#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))))] [2022-03-15 19:46:06,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:46:06,876 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:06,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:46:06,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=557, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:46:06,877 INFO L87 Difference]: Start difference. First operand 477 states and 1349 transitions. Second operand has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:08,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:08,483 INFO L93 Difference]: Finished difference Result 690 states and 1803 transitions. [2022-03-15 19:46:08,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 19:46:08,483 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 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 19:46:08,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:08,485 INFO L225 Difference]: With dead ends: 690 [2022-03-15 19:46:08,485 INFO L226 Difference]: Without dead ends: 660 [2022-03-15 19:46:08,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=398, Invalid=1494, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 19:46:08,486 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 119 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:08,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 51 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:46:08,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2022-03-15 19:46:08,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 506. [2022-03-15 19:46:08,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 505 states have (on average 2.8257425742574256) internal successors, (1427), 505 states have internal predecessors, (1427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:08,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 1427 transitions. [2022-03-15 19:46:08,494 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 1427 transitions. Word has length 21 [2022-03-15 19:46:08,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:08,494 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 1427 transitions. [2022-03-15 19:46:08,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:08,495 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 1427 transitions. [2022-03-15 19:46:08,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:46:08,496 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:08,496 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:08,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-03-15 19:46:08,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:08,708 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:08,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:08,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1779576855, now seen corresponding path program 34 times [2022-03-15 19:46:08,709 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:08,709 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790432021] [2022-03-15 19:46:08,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:08,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:09,167 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:09,168 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:09,168 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790432021] [2022-03-15 19:46:09,168 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790432021] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:09,168 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571429872] [2022-03-15 19:46:09,168 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:46:09,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:09,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:09,169 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:09,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-03-15 19:46:09,295 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:46:09,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:09,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 19:46:09,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:09,465 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-03-15 19:46:09,538 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:46:09,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:09,627 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:46:09,627 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 42 treesize of output 34 [2022-03-15 19:46:09,719 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:46:09,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571429872] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:09,720 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:09,720 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 5] total 24 [2022-03-15 19:46:09,720 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1194469634] [2022-03-15 19:46:09,720 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:09,722 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:09,728 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 53 transitions. [2022-03-15 19:46:09,728 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:10,975 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [48243#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 48244#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 48242#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 48241#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 48245#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (<= ~N~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< 1 ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (<= ~N~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< 1 ~N~0)))] [2022-03-15 19:46:10,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:46:10,975 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:10,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:46:10,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=776, Unknown=0, NotChecked=0, Total=930 [2022-03-15 19:46:10,976 INFO L87 Difference]: Start difference. First operand 506 states and 1427 transitions. Second operand has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:12,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:12,662 INFO L93 Difference]: Finished difference Result 649 states and 1700 transitions. [2022-03-15 19:46:12,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:46:12,662 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 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 21 [2022-03-15 19:46:12,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:12,665 INFO L225 Difference]: With dead ends: 649 [2022-03-15 19:46:12,665 INFO L226 Difference]: Without dead ends: 635 [2022-03-15 19:46:12,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=366, Invalid=1986, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 19:46:12,665 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 124 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:12,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 39 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:46:12,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2022-03-15 19:46:12,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 508. [2022-03-15 19:46:12,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 507 states have (on average 2.824457593688363) internal successors, (1432), 507 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:12,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 1432 transitions. [2022-03-15 19:46:12,673 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 1432 transitions. Word has length 21 [2022-03-15 19:46:12,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:12,673 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 1432 transitions. [2022-03-15 19:46:12,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:12,673 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 1432 transitions. [2022-03-15 19:46:12,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:46:12,674 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:12,674 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:12,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-03-15 19:46:12,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-03-15 19:46:12,874 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:12,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:12,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1691193561, now seen corresponding path program 35 times [2022-03-15 19:46:12,875 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:12,876 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152301146] [2022-03-15 19:46:12,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:12,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:13,690 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:13,690 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:13,690 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152301146] [2022-03-15 19:46:13,690 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152301146] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:13,690 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485662912] [2022-03-15 19:46:13,690 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:46:13,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:13,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:13,693 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:13,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-03-15 19:46:13,825 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:46:13,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:13,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 19:46:13,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:14,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:46:14,079 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:46:14,129 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:46:14,176 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:46:14,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:14,264 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1932 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1932) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))) (or (let ((.cse0 (+ c_~s~0 .cse1))) (and (<= c_~N~0 .cse0) (< .cse0 (+ c_~N~0 1)))) (= 0 .cse1)))) is different from false [2022-03-15 19:46:14,327 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:46:14,327 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 115 treesize of output 99 [2022-03-15 19:46:14,333 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 71 treesize of output 53 [2022-03-15 19:46:14,572 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:46:14,572 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485662912] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:14,572 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:14,572 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 7] total 30 [2022-03-15 19:46:14,572 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [802691092] [2022-03-15 19:46:14,573 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:14,574 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:14,579 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 39 transitions. [2022-03-15 19:46:14,579 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:15,151 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [50099#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 50100#(and (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)))] [2022-03-15 19:46:15,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:46:15,152 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:15,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:46:15,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=915, Unknown=1, NotChecked=62, Total=1122 [2022-03-15 19:46:15,152 INFO L87 Difference]: Start difference. First operand 508 states and 1432 transitions. Second operand has 17 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:16,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:16,361 INFO L93 Difference]: Finished difference Result 566 states and 1572 transitions. [2022-03-15 19:46:16,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 19:46:16,362 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:46:16,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:16,364 INFO L225 Difference]: With dead ends: 566 [2022-03-15 19:46:16,364 INFO L226 Difference]: Without dead ends: 547 [2022-03-15 19:46:16,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=278, Invalid=1705, Unknown=1, NotChecked=86, Total=2070 [2022-03-15 19:46:16,364 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 97 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:16,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 49 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:46:16,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-03-15 19:46:16,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 512. [2022-03-15 19:46:16,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 511 states have (on average 2.8219178082191783) internal successors, (1442), 511 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:16,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 1442 transitions. [2022-03-15 19:46:16,372 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 1442 transitions. Word has length 21 [2022-03-15 19:46:16,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:16,372 INFO L470 AbstractCegarLoop]: Abstraction has 512 states and 1442 transitions. [2022-03-15 19:46:16,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:16,372 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 1442 transitions. [2022-03-15 19:46:16,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:46:16,373 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:16,373 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:16,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-03-15 19:46:16,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:16,574 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:16,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:16,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1969782641, now seen corresponding path program 36 times [2022-03-15 19:46:16,575 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:16,575 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440692125] [2022-03-15 19:46:16,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:16,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:17,153 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:46:17,154 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:17,154 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440692125] [2022-03-15 19:46:17,154 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440692125] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:17,154 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237342454] [2022-03-15 19:46:17,154 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:46:17,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:17,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:17,156 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:17,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-03-15 19:46:17,309 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:46:17,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:17,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 19:46:17,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:17,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:46:17,444 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:46:17,490 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-03-15 19:46:17,551 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:46:17,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:17,709 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:46:17,709 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 86 treesize of output 78 [2022-03-15 19:46:17,713 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 57 treesize of output 51 [2022-03-15 19:46:17,716 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 51 treesize of output 45 [2022-03-15 19:46:17,901 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:46:17,901 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237342454] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:17,901 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:17,901 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 24 [2022-03-15 19:46:17,901 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [312469352] [2022-03-15 19:46:17,902 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:17,903 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:17,908 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 33 transitions. [2022-03-15 19:46:17,908 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:18,424 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [51862#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 51863#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 51861#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))))] [2022-03-15 19:46:18,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:46:18,424 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:18,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:46:18,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=682, Unknown=3, NotChecked=0, Total=812 [2022-03-15 19:46:18,425 INFO L87 Difference]: Start difference. First operand 512 states and 1442 transitions. Second operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:19,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:19,112 INFO L93 Difference]: Finished difference Result 626 states and 1692 transitions. [2022-03-15 19:46:19,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 19:46:19,112 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:46:19,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:19,115 INFO L225 Difference]: With dead ends: 626 [2022-03-15 19:46:19,115 INFO L226 Difference]: Without dead ends: 610 [2022-03-15 19:46:19,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=235, Invalid=1322, Unknown=3, NotChecked=0, Total=1560 [2022-03-15 19:46:19,116 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 80 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:19,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 25 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:46:19,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-03-15 19:46:19,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 515. [2022-03-15 19:46:19,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 514 states have (on average 2.842412451361868) internal successors, (1461), 514 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:19,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 1461 transitions. [2022-03-15 19:46:19,126 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 1461 transitions. Word has length 21 [2022-03-15 19:46:19,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:19,126 INFO L470 AbstractCegarLoop]: Abstraction has 515 states and 1461 transitions. [2022-03-15 19:46:19,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:19,126 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 1461 transitions. [2022-03-15 19:46:19,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:46:19,127 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:19,127 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:19,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-03-15 19:46:19,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-03-15 19:46:19,328 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:19,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:19,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1011294501, now seen corresponding path program 37 times [2022-03-15 19:46:19,329 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:19,329 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513955095] [2022-03-15 19:46:19,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:19,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:19,374 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:46:19,374 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:19,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513955095] [2022-03-15 19:46:19,374 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513955095] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:19,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401308380] [2022-03-15 19:46:19,374 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:46:19,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:19,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:19,376 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:19,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-03-15 19:46:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:19,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:46:19,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:19,664 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:46:19,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:19,852 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:46:19,853 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401308380] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:19,853 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:19,853 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 23 [2022-03-15 19:46:19,853 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [561772630] [2022-03-15 19:46:19,853 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:19,856 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:19,869 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 90 transitions. [2022-03-15 19:46:19,869 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:19,884 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 12 treesize of output 4 [2022-03-15 19:46:19,909 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2022-03-15 19:46:19,938 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2022-03-15 19:46:19,970 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2022-03-15 19:46:20,044 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:46:20,103 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:46:20,188 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2022-03-15 19:46:20,252 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:46:20,277 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 12 treesize of output 4 [2022-03-15 19:46:20,298 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 12 treesize of output 4 [2022-03-15 19:46:20,319 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 12 treesize of output 4 [2022-03-15 19:46:20,457 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [53694#(or (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))), 53693#(or (<= ~q_back~0 (+ ~q_front~0 1)) (< ~q_front~0 0)), 53695#(or (<= ~q_back~0 (+ 3 ~q_front~0)) (< ~q_front~0 0)), 53692#(or (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0))] [2022-03-15 19:46:20,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:46:20,457 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:20,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:46:20,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=556, Unknown=0, NotChecked=0, Total=756 [2022-03-15 19:46:20,458 INFO L87 Difference]: Start difference. First operand 515 states and 1461 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:20,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:20,523 INFO L93 Difference]: Finished difference Result 770 states and 2163 transitions. [2022-03-15 19:46:20,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:46:20,523 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:46:20,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:20,525 INFO L225 Difference]: With dead ends: 770 [2022-03-15 19:46:20,525 INFO L226 Difference]: Without dead ends: 748 [2022-03-15 19:46:20,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=556, Unknown=0, NotChecked=0, Total=756 [2022-03-15 19:46:20,526 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 72 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:20,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 8 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:46:20,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2022-03-15 19:46:20,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 660. [2022-03-15 19:46:20,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 659 states have (on average 2.866464339908953) internal successors, (1889), 659 states have internal predecessors, (1889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:20,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1889 transitions. [2022-03-15 19:46:20,537 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1889 transitions. Word has length 22 [2022-03-15 19:46:20,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:20,537 INFO L470 AbstractCegarLoop]: Abstraction has 660 states and 1889 transitions. [2022-03-15 19:46:20,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:20,538 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1889 transitions. [2022-03-15 19:46:20,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:46:20,539 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:20,539 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:20,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-03-15 19:46:20,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2022-03-15 19:46:20,739 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:20,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:20,740 INFO L85 PathProgramCache]: Analyzing trace with hash -653774986, now seen corresponding path program 38 times [2022-03-15 19:46:20,740 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:20,741 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695982780] [2022-03-15 19:46:20,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:20,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:20,802 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:46:20,802 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:20,803 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695982780] [2022-03-15 19:46:20,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695982780] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:20,803 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464420342] [2022-03-15 19:46:20,803 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:46:20,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:20,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:20,804 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:20,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-03-15 19:46:20,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:46:20,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:20,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 19:46:20,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:21,101 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:46:21,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:21,224 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:46:21,225 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464420342] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:21,225 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:21,225 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-03-15 19:46:21,225 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [374726866] [2022-03-15 19:46:21,225 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:21,228 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:21,236 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 55 transitions. [2022-03-15 19:46:21,236 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:21,251 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 12 treesize of output 4 [2022-03-15 19:46:21,298 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2022-03-15 19:46:21,367 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:46:21,413 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2022-03-15 19:46:21,442 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2022-03-15 19:46:21,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 11 treesize of output 3 [2022-03-15 19:46:21,540 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 12 treesize of output 4 [2022-03-15 19:46:21,624 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [55896#(or (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))), 55936#(or (<= ~q_back~0 0) (<= ~n~0 0))] [2022-03-15 19:46:21,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:46:21,624 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:21,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:46:21,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2022-03-15 19:46:21,625 INFO L87 Difference]: Start difference. First operand 660 states and 1889 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 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 19:46:21,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:21,749 INFO L93 Difference]: Finished difference Result 436 states and 997 transitions. [2022-03-15 19:46:21,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:46:21,749 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 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 22 [2022-03-15 19:46:21,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:21,750 INFO L225 Difference]: With dead ends: 436 [2022-03-15 19:46:21,750 INFO L226 Difference]: Without dead ends: 293 [2022-03-15 19:46:21,751 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=192, Invalid=620, Unknown=0, NotChecked=0, Total=812 [2022-03-15 19:46:21,751 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 37 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:21,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 26 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:46:21,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-03-15 19:46:21,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2022-03-15 19:46:21,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 2.613013698630137) internal successors, (763), 292 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:21,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 763 transitions. [2022-03-15 19:46:21,756 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 763 transitions. Word has length 22 [2022-03-15 19:46:21,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:21,756 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 763 transitions. [2022-03-15 19:46:21,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 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 19:46:21,756 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 763 transitions. [2022-03-15 19:46:21,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:46:21,757 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:21,757 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:21,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-03-15 19:46:21,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:21,967 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:21,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:21,968 INFO L85 PathProgramCache]: Analyzing trace with hash 302725582, now seen corresponding path program 39 times [2022-03-15 19:46:21,969 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:21,969 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173957632] [2022-03-15 19:46:21,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:21,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:22,602 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:22,602 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:22,602 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173957632] [2022-03-15 19:46:22,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173957632] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:22,602 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39148233] [2022-03-15 19:46:22,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:46:22,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:22,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:22,604 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:22,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-03-15 19:46:22,755 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:46:22,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:22,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-15 19:46:22,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:22,949 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:46:22,950 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 14 [2022-03-15 19:46:22,993 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:46:22,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:23,178 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:46:23,179 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 78 [2022-03-15 19:46:23,318 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:46:23,318 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39148233] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:23,318 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:23,318 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 25 [2022-03-15 19:46:23,319 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1938588031] [2022-03-15 19:46:23,319 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:23,321 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:23,328 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 62 transitions. [2022-03-15 19:46:23,328 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:25,869 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [57120#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 57121#(and (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0))), 57124#(and (or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 57123#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 57122#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 57126#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 1) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ 2 ~q_back~0)) (< 2 ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 1) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0)) (< 2 ~N~0))), 57125#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ 2 ~q_back~0))))] [2022-03-15 19:46:25,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:46:25,869 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:25,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:46:25,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=969, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:46:25,870 INFO L87 Difference]: Start difference. First operand 293 states and 763 transitions. Second operand has 22 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:29,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:29,038 INFO L93 Difference]: Finished difference Result 505 states and 1213 transitions. [2022-03-15 19:46:29,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 19:46:29,039 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 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 22 [2022-03-15 19:46:29,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:29,040 INFO L225 Difference]: With dead ends: 505 [2022-03-15 19:46:29,040 INFO L226 Difference]: Without dead ends: 479 [2022-03-15 19:46:29,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 34 SyntacticMatches, 8 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=287, Invalid=1875, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 19:46:29,040 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 101 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:29,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 64 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:46:29,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-03-15 19:46:29,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 335. [2022-03-15 19:46:29,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 2.691616766467066) internal successors, (899), 334 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:29,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 899 transitions. [2022-03-15 19:46:29,045 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 899 transitions. Word has length 22 [2022-03-15 19:46:29,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:29,045 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 899 transitions. [2022-03-15 19:46:29,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:29,045 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 899 transitions. [2022-03-15 19:46:29,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:46:29,046 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:29,046 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:29,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-03-15 19:46:29,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-03-15 19:46:29,247 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:29,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:29,247 INFO L85 PathProgramCache]: Analyzing trace with hash -441976916, now seen corresponding path program 40 times [2022-03-15 19:46:29,247 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:29,248 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896346859] [2022-03-15 19:46:29,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:29,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:30,012 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:30,013 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:30,013 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896346859] [2022-03-15 19:46:30,013 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896346859] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:30,013 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500127926] [2022-03-15 19:46:30,013 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:46:30,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:30,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:30,014 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:30,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-03-15 19:46:30,154 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:46:30,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:30,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 57 conjunts are in the unsatisfiable core [2022-03-15 19:46:30,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:30,392 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:46:30,392 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 12 [2022-03-15 19:46:30,479 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:46:30,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:30,695 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:46:30,696 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 89 treesize of output 81 [2022-03-15 19:46:30,854 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:46:30,855 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500127926] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:30,855 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:30,855 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 7] total 28 [2022-03-15 19:46:30,855 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1800375084] [2022-03-15 19:46:30,855 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:30,858 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:30,867 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 58 transitions. [2022-03-15 19:46:30,867 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:33,135 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [58490#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 1) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0)) (< 2 ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 1) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0)) (< 2 ~N~0))), 58485#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 58484#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 58486#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 58487#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 58488#(and (or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 58489#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0))))] [2022-03-15 19:46:33,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:46:33,135 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:33,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:46:33,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1167, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:46:33,136 INFO L87 Difference]: Start difference. First operand 335 states and 899 transitions. Second operand has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:37,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:37,354 INFO L93 Difference]: Finished difference Result 522 states and 1246 transitions. [2022-03-15 19:46:37,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 19:46:37,354 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 0 states have call successors, (0), 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 22 [2022-03-15 19:46:37,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:37,355 INFO L225 Difference]: With dead ends: 522 [2022-03-15 19:46:37,355 INFO L226 Difference]: Without dead ends: 504 [2022-03-15 19:46:37,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 28 SyntacticMatches, 9 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=350, Invalid=2620, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 19:46:37,356 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 128 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:37,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 59 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:46:37,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-03-15 19:46:37,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 339. [2022-03-15 19:46:37,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 2.6893491124260356) internal successors, (909), 338 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:37,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 909 transitions. [2022-03-15 19:46:37,361 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 909 transitions. Word has length 22 [2022-03-15 19:46:37,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:37,361 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 909 transitions. [2022-03-15 19:46:37,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:37,361 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 909 transitions. [2022-03-15 19:46:37,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:46:37,361 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:37,362 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:37,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-03-15 19:46:37,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-03-15 19:46:37,562 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:37,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:37,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1388939842, now seen corresponding path program 41 times [2022-03-15 19:46:37,563 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:37,563 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110828028] [2022-03-15 19:46:37,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:37,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:38,238 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:38,239 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:38,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110828028] [2022-03-15 19:46:38,239 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110828028] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:38,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082869289] [2022-03-15 19:46:38,239 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:46:38,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:38,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:38,240 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:38,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-03-15 19:46:38,379 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:46:38,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:38,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 55 conjunts are in the unsatisfiable core [2022-03-15 19:46:38,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:38,640 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:46:38,640 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 12 [2022-03-15 19:46:38,717 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:46:38,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:38,976 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:46:38,977 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 89 treesize of output 81 [2022-03-15 19:46:39,109 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:46:39,109 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082869289] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:39,109 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:39,109 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 7] total 28 [2022-03-15 19:46:39,109 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1913585955] [2022-03-15 19:46:39,109 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:39,111 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:39,120 INFO L252 McrAutomatonBuilder]: Finished intersection with 52 states and 84 transitions. [2022-03-15 19:46:39,121 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:42,311 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [59886#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)))), 59885#(and (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0)))), 59889#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 1) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ 2 ~q_back~0)) (< 2 ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 1) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0)) (< 2 ~N~0))), 59883#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 59884#(and (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0))), 59888#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ 2 ~q_back~0)))), 59887#(and (or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)))] [2022-03-15 19:46:42,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:46:42,311 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:42,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:46:42,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1150, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:46:42,312 INFO L87 Difference]: Start difference. First operand 339 states and 909 transitions. Second operand has 22 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:46,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:46,012 INFO L93 Difference]: Finished difference Result 538 states and 1356 transitions. [2022-03-15 19:46:46,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 19:46:46,012 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:46:46,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:46,013 INFO L225 Difference]: With dead ends: 538 [2022-03-15 19:46:46,013 INFO L226 Difference]: Without dead ends: 490 [2022-03-15 19:46:46,013 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 38 SyntacticMatches, 12 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=403, Invalid=2459, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 19:46:46,014 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 106 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:46,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 69 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:46:46,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-03-15 19:46:46,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 378. [2022-03-15 19:46:46,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 2.684350132625995) internal successors, (1012), 377 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:46,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1012 transitions. [2022-03-15 19:46:46,019 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1012 transitions. Word has length 22 [2022-03-15 19:46:46,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:46,019 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 1012 transitions. [2022-03-15 19:46:46,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:46,019 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1012 transitions. [2022-03-15 19:46:46,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:46:46,019 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:46,019 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:46,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-03-15 19:46:46,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:46,220 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:46,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:46,220 INFO L85 PathProgramCache]: Analyzing trace with hash -222001116, now seen corresponding path program 42 times [2022-03-15 19:46:46,221 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:46,221 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398226475] [2022-03-15 19:46:46,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:46,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:46,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:46,801 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:46,801 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:46,801 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398226475] [2022-03-15 19:46:46,801 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398226475] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:46,801 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238314092] [2022-03-15 19:46:46,801 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:46:46,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:46,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:46,802 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:46,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-03-15 19:46:46,946 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:46:46,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:46,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 19:46:46,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:47,197 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:46:47,198 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 12 [2022-03-15 19:46:47,260 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:46:47,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:47,457 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:46:47,458 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 78 [2022-03-15 19:46:47,571 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:46:47,572 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238314092] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:47,572 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:47,572 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 7] total 28 [2022-03-15 19:46:47,572 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2024586402] [2022-03-15 19:46:47,572 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:47,574 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:47,581 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 69 transitions. [2022-03-15 19:46:47,582 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:49,949 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [61378#(and (or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 61377#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)))), 61380#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 1) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ 2 ~q_back~0)) (< 2 ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 1) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0)) (< 2 ~N~0))), 61375#(and (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0))), 61376#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 61374#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 61379#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ 2 ~q_back~0))))] [2022-03-15 19:46:49,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:46:49,949 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:49,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:46:49,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1127, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:46:49,950 INFO L87 Difference]: Start difference. First operand 378 states and 1012 transitions. Second operand has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:53,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:53,641 INFO L93 Difference]: Finished difference Result 536 states and 1304 transitions. [2022-03-15 19:46:53,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 19:46:53,641 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:46:53,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:53,642 INFO L225 Difference]: With dead ends: 536 [2022-03-15 19:46:53,642 INFO L226 Difference]: Without dead ends: 510 [2022-03-15 19:46:53,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 35 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=487, Invalid=2483, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 19:46:53,642 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 131 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:53,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 82 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:46:53,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-03-15 19:46:53,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 382. [2022-03-15 19:46:53,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 2.6824146981627295) internal successors, (1022), 381 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:53,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1022 transitions. [2022-03-15 19:46:53,647 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1022 transitions. Word has length 22 [2022-03-15 19:46:53,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:53,648 INFO L470 AbstractCegarLoop]: Abstraction has 382 states and 1022 transitions. [2022-03-15 19:46:53,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:53,648 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1022 transitions. [2022-03-15 19:46:53,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:46:53,648 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:53,648 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:53,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-03-15 19:46:53,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:53,849 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:53,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:53,849 INFO L85 PathProgramCache]: Analyzing trace with hash -966703614, now seen corresponding path program 43 times [2022-03-15 19:46:53,850 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:53,850 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210397749] [2022-03-15 19:46:53,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:53,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:55,725 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:55,726 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:55,726 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210397749] [2022-03-15 19:46:55,726 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210397749] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:55,726 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685922853] [2022-03-15 19:46:55,726 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:46:55,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:55,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:55,727 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:55,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-03-15 19:46:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:55,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 56 conjunts are in the unsatisfiable core [2022-03-15 19:46:55,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:56,108 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:46:56,108 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 65 treesize of output 22 [2022-03-15 19:46:56,199 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:46:56,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:56,428 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:46:56,429 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 100 treesize of output 84 [2022-03-15 19:46:56,560 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:46:56,561 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685922853] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:56,561 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:56,561 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 7] total 28 [2022-03-15 19:46:56,561 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [527574764] [2022-03-15 19:46:56,561 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:56,563 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:56,588 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 65 transitions. [2022-03-15 19:46:56,588 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:59,886 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [62875#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 62879#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 1) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ 2 ~q_back~0)) (< 2 ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 1) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0)) (< 2 ~N~0))), 62878#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ 2 ~q_back~0)))), 62873#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 62874#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (< ~s~0 (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~N~0 ~s~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 62876#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)))), 62877#(and (or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)))] [2022-03-15 19:46:59,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:46:59,886 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:59,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:46:59,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1161, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:46:59,887 INFO L87 Difference]: Start difference. First operand 382 states and 1022 transitions. Second operand has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:05,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:05,276 INFO L93 Difference]: Finished difference Result 607 states and 1475 transitions. [2022-03-15 19:47:05,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 19:47:05,276 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 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 22 [2022-03-15 19:47:05,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:05,277 INFO L225 Difference]: With dead ends: 607 [2022-03-15 19:47:05,277 INFO L226 Difference]: Without dead ends: 589 [2022-03-15 19:47:05,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 31 SyntacticMatches, 10 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=457, Invalid=3203, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 19:47:05,278 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 131 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:05,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 73 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:47:05,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-03-15 19:47:05,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 402. [2022-03-15 19:47:05,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 401 states have (on average 2.7306733167082293) internal successors, (1095), 401 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:05,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1095 transitions. [2022-03-15 19:47:05,284 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1095 transitions. Word has length 22 [2022-03-15 19:47:05,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:05,284 INFO L470 AbstractCegarLoop]: Abstraction has 402 states and 1095 transitions. [2022-03-15 19:47:05,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:05,284 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1095 transitions. [2022-03-15 19:47:05,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:47:05,285 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:05,285 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:05,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2022-03-15 19:47:05,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:05,485 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:47:05,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:05,486 INFO L85 PathProgramCache]: Analyzing trace with hash 838993076, now seen corresponding path program 44 times [2022-03-15 19:47:05,486 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:05,486 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589925541] [2022-03-15 19:47:05,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:05,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:06,202 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:06,203 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:06,203 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589925541] [2022-03-15 19:47:06,203 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589925541] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:47:06,203 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496476235] [2022-03-15 19:47:06,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:47:06,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:06,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:06,204 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:47:06,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-03-15 19:47:06,350 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:47:06,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:47:06,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-15 19:47:06,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:47:06,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:47:06,634 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-03-15 19:47:06,731 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:47:06,731 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 50 treesize of output 14 [2022-03-15 19:47:06,781 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:47:06,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:06,886 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2308 (Array Int Int))) (< (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2308) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse0 (+ .cse1 c_~q~0.offset 4)) (select .cse0 (+ .cse1 c_~q~0.offset)))) (+ c_~N~0 1))) (forall ((v_ArrVal_2308 (Array Int Int))) (<= c_~N~0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2308) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse2 (+ .cse3 c_~q~0.offset 4)) (select .cse2 (+ .cse3 c_~q~0.offset))))))) is different from false [2022-03-15 19:47:07,030 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:47:07,031 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 140 [2022-03-15 19:47:07,038 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:47:07,038 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 66 [2022-03-15 19:47:07,043 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:47:07,044 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 53 [2022-03-15 19:47:07,287 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:47:07,287 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496476235] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:47:07,287 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:47:07,287 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 9] total 34 [2022-03-15 19:47:07,287 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1386434684] [2022-03-15 19:47:07,287 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:07,289 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:07,295 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 46 transitions. [2022-03-15 19:47:07,295 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:08,256 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [64501#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 64503#(and (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0)))), 64502#(and (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1))))] [2022-03-15 19:47:08,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:47:08,257 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:08,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:47:08,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1228, Unknown=1, NotChecked=72, Total=1482 [2022-03-15 19:47:08,257 INFO L87 Difference]: Start difference. First operand 402 states and 1095 transitions. Second operand has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:09,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:09,277 INFO L93 Difference]: Finished difference Result 482 states and 1323 transitions. [2022-03-15 19:47:09,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 19:47:09,278 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 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 22 [2022-03-15 19:47:09,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:09,279 INFO L225 Difference]: With dead ends: 482 [2022-03-15 19:47:09,279 INFO L226 Difference]: Without dead ends: 450 [2022-03-15 19:47:09,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=282, Invalid=1701, Unknown=1, NotChecked=86, Total=2070 [2022-03-15 19:47:09,279 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 89 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:09,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 57 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:47:09,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-03-15 19:47:09,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 395. [2022-03-15 19:47:09,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 394 states have (on average 2.6802030456852792) internal successors, (1056), 394 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:09,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1056 transitions. [2022-03-15 19:47:09,284 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1056 transitions. Word has length 22 [2022-03-15 19:47:09,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:09,284 INFO L470 AbstractCegarLoop]: Abstraction has 395 states and 1056 transitions. [2022-03-15 19:47:09,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:09,285 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1056 transitions. [2022-03-15 19:47:09,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:47:09,286 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:09,286 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:09,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-03-15 19:47:09,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-03-15 19:47:09,510 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:47:09,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:09,510 INFO L85 PathProgramCache]: Analyzing trace with hash -982119490, now seen corresponding path program 45 times [2022-03-15 19:47:09,511 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:09,511 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740047223] [2022-03-15 19:47:09,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:09,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:11,518 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:11,518 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:11,518 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740047223] [2022-03-15 19:47:11,518 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740047223] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:47:11,518 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150699797] [2022-03-15 19:47:11,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:47:11,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:11,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:11,520 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:47:11,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-03-15 19:47:11,777 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:47:11,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:47:11,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 48 conjunts are in the unsatisfiable core [2022-03-15 19:47:11,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:47:11,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:47:11,963 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-03-15 19:47:12,098 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:47:12,099 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 12 [2022-03-15 19:47:12,146 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:47:12,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:12,466 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:47:12,466 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 168 treesize of output 161 [2022-03-15 19:47:12,472 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:47:12,472 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 61 [2022-03-15 19:47:12,712 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:47:12,713 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150699797] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:47:12,713 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:47:12,713 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 31 [2022-03-15 19:47:12,713 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [859242560] [2022-03-15 19:47:12,713 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:12,715 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:12,720 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 40 transitions. [2022-03-15 19:47:12,720 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:13,516 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [65949#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 65951#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 65952#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)))), 65950#(and (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)))] [2022-03-15 19:47:13,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:47:13,516 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:13,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:47:13,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1151, Unknown=3, NotChecked=0, Total=1332 [2022-03-15 19:47:13,516 INFO L87 Difference]: Start difference. First operand 395 states and 1056 transitions. Second operand has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:15,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:15,358 INFO L93 Difference]: Finished difference Result 443 states and 1147 transitions. [2022-03-15 19:47:15,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 19:47:15,358 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 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 22 [2022-03-15 19:47:15,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:15,359 INFO L225 Difference]: With dead ends: 443 [2022-03-15 19:47:15,359 INFO L226 Difference]: Without dead ends: 430 [2022-03-15 19:47:15,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=360, Invalid=1893, Unknown=3, NotChecked=0, Total=2256 [2022-03-15 19:47:15,360 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 109 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:15,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 59 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:47:15,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2022-03-15 19:47:15,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 395. [2022-03-15 19:47:15,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 394 states have (on average 2.6700507614213196) internal successors, (1052), 394 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:15,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1052 transitions. [2022-03-15 19:47:15,364 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1052 transitions. Word has length 22 [2022-03-15 19:47:15,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:15,365 INFO L470 AbstractCegarLoop]: Abstraction has 395 states and 1052 transitions. [2022-03-15 19:47:15,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:15,365 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1052 transitions. [2022-03-15 19:47:15,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:47:15,365 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:15,365 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:15,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-03-15 19:47:15,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60 [2022-03-15 19:47:15,566 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:47:15,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:15,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1726821988, now seen corresponding path program 46 times [2022-03-15 19:47:15,569 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:15,569 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054755187] [2022-03-15 19:47:15,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:15,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:16,630 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:16,630 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:16,630 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054755187] [2022-03-15 19:47:16,630 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054755187] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:47:16,630 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877263983] [2022-03-15 19:47:16,630 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:47:16,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:16,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:16,632 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:47:16,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-03-15 19:47:16,787 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:47:16,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:47:16,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 71 conjunts are in the unsatisfiable core [2022-03-15 19:47:16,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:47:17,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:47:17,243 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-03-15 19:47:17,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:47:17,406 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:47:17,406 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 22 [2022-03-15 19:47:17,502 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:17,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:17,894 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:47:17,894 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 183 [2022-03-15 19:47:17,901 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:47:17,901 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 68 [2022-03-15 19:47:18,517 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:18,517 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877263983] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:47:18,517 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:47:18,517 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 39 [2022-03-15 19:47:18,517 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1064815681] [2022-03-15 19:47:18,517 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:18,519 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:18,525 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 36 transitions. [2022-03-15 19:47:18,526 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:19,204 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [67377#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 67376#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (< ~s~0 (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~N~0 ~s~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 67375#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 67378#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1))))] [2022-03-15 19:47:19,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:47:19,205 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:19,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:47:19,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=1695, Unknown=3, NotChecked=0, Total=1980 [2022-03-15 19:47:19,205 INFO L87 Difference]: Start difference. First operand 395 states and 1052 transitions. Second operand has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:20,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:20,171 INFO L93 Difference]: Finished difference Result 406 states and 1066 transitions. [2022-03-15 19:47:20,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 19:47:20,172 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:47:20,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:20,173 INFO L225 Difference]: With dead ends: 406 [2022-03-15 19:47:20,173 INFO L226 Difference]: Without dead ends: 397 [2022-03-15 19:47:20,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=329, Invalid=2218, Unknown=3, NotChecked=0, Total=2550 [2022-03-15 19:47:20,173 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 44 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:20,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 49 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:47:20,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-03-15 19:47:20,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 391. [2022-03-15 19:47:20,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 390 states have (on average 2.6717948717948716) internal successors, (1042), 390 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 19:47:20,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1042 transitions. [2022-03-15 19:47:20,186 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1042 transitions. Word has length 22 [2022-03-15 19:47:20,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:20,186 INFO L470 AbstractCegarLoop]: Abstraction has 391 states and 1042 transitions. [2022-03-15 19:47:20,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:20,186 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1042 transitions. [2022-03-15 19:47:20,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:47:20,187 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:20,187 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:20,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-03-15 19:47:20,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2022-03-15 19:47:20,387 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:47:20,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:20,388 INFO L85 PathProgramCache]: Analyzing trace with hash -2096408332, now seen corresponding path program 47 times [2022-03-15 19:47:20,389 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:20,389 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364108617] [2022-03-15 19:47:20,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:20,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:22,298 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:22,299 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:22,299 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364108617] [2022-03-15 19:47:22,299 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364108617] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:47:22,299 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89779227] [2022-03-15 19:47:22,299 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:47:22,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:22,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:22,300 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:47:22,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-03-15 19:47:22,452 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:47:22,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:47:22,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 57 conjunts are in the unsatisfiable core [2022-03-15 19:47:22,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:47:22,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:47:22,653 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:47:22,818 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:47:22,819 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 14 [2022-03-15 19:47:22,884 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:47:22,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:23,088 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2437 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2437) c_~q~0.base))) (or (not (= (select .cse0 (+ c_~q~0.offset (* 4 c_~q_back~0))) 1)) (let ((.cse2 (let ((.cse3 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse0 (+ .cse3 c_~q~0.offset)) (select .cse0 (+ .cse3 c_~q~0.offset 4))))) (.cse1 (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1))) (and (<= .cse1 .cse2) (<= .cse2 .cse1)))))) is different from false [2022-03-15 19:47:23,123 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:47:23,123 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 161 [2022-03-15 19:47:23,140 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:47:23,140 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 105 treesize of output 98 [2022-03-15 19:47:23,643 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:47:23,643 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89779227] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:47:23,643 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:47:23,643 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 9] total 33 [2022-03-15 19:47:23,643 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1456948703] [2022-03-15 19:47:23,644 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:23,645 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:23,651 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 42 transitions. [2022-03-15 19:47:23,651 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:24,725 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [68741#(and (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)))), 68743#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 68744#(and (or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 68742#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 68740#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))))] [2022-03-15 19:47:24,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:47:24,725 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:24,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:47:24,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1278, Unknown=1, NotChecked=74, Total=1560 [2022-03-15 19:47:24,726 INFO L87 Difference]: Start difference. First operand 391 states and 1042 transitions. Second operand has 21 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:30,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:30,709 INFO L93 Difference]: Finished difference Result 1129 states and 2905 transitions. [2022-03-15 19:47:30,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-15 19:47:30,709 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 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 22 [2022-03-15 19:47:30,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:30,711 INFO L225 Difference]: With dead ends: 1129 [2022-03-15 19:47:30,711 INFO L226 Difference]: Without dead ends: 1072 [2022-03-15 19:47:30,711 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=700, Invalid=4415, Unknown=1, NotChecked=140, Total=5256 [2022-03-15 19:47:30,712 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 196 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:30,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 55 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:47:30,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2022-03-15 19:47:30,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 597. [2022-03-15 19:47:30,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 3.028523489932886) internal successors, (1805), 596 states have internal predecessors, (1805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:30,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1805 transitions. [2022-03-15 19:47:30,723 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1805 transitions. Word has length 22 [2022-03-15 19:47:30,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:30,723 INFO L470 AbstractCegarLoop]: Abstraction has 597 states and 1805 transitions. [2022-03-15 19:47:30,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:30,723 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1805 transitions. [2022-03-15 19:47:30,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:47:30,724 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:30,724 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:30,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-03-15 19:47:30,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:30,925 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:47:30,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:30,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1453856466, now seen corresponding path program 48 times [2022-03-15 19:47:30,926 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:30,926 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714508840] [2022-03-15 19:47:30,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:30,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:31,882 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:31,882 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:31,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714508840] [2022-03-15 19:47:31,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714508840] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:47:31,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149728319] [2022-03-15 19:47:31,882 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:47:31,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:31,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:31,884 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:47:31,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-03-15 19:47:32,039 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:47:32,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:47:32,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 60 conjunts are in the unsatisfiable core [2022-03-15 19:47:32,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:47:32,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:47:32,245 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:47:32,366 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:47:32,367 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 12 [2022-03-15 19:47:32,471 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:47:32,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:32,688 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2480 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2480) c_~q~0.base)) (.cse4 (* c_~q_front~0 4))) (let ((.cse0 (select .cse1 (+ .cse4 c_~q~0.offset)))) (or (= .cse0 0) (not (= (select .cse1 (+ c_~q~0.offset (* 4 c_~q_back~0))) 1)) (let ((.cse3 (+ c_~s~0 .cse0 (select .cse1 (+ .cse4 c_~q~0.offset 4)))) (.cse2 (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))))))) is different from false [2022-03-15 19:47:32,726 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:47:32,726 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 189 treesize of output 182 [2022-03-15 19:47:32,743 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:47:32,744 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 118 treesize of output 105 [2022-03-15 19:47:33,219 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:47:33,219 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149728319] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:47:33,219 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:47:33,219 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 9] total 34 [2022-03-15 19:47:33,219 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [66833032] [2022-03-15 19:47:33,220 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:33,222 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:33,228 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 38 transitions. [2022-03-15 19:47:33,228 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:34,212 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [71298#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 71299#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 71300#(and (or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 71296#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 71297#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (< ~s~0 (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~N~0 ~s~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))))] [2022-03-15 19:47:34,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:47:34,213 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:34,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:47:34,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1382, Unknown=1, NotChecked=76, Total=1640 [2022-03-15 19:47:34,213 INFO L87 Difference]: Start difference. First operand 597 states and 1805 transitions. Second operand has 21 states, 20 states have (on average 1.75) internal successors, (35), 20 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:36,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:36,934 INFO L93 Difference]: Finished difference Result 749 states and 2079 transitions. [2022-03-15 19:47:36,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 19:47:36,935 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.75) internal successors, (35), 20 states have internal predecessors, (35), 0 states have call successors, (0), 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 22 [2022-03-15 19:47:36,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:36,936 INFO L225 Difference]: With dead ends: 749 [2022-03-15 19:47:36,936 INFO L226 Difference]: Without dead ends: 731 [2022-03-15 19:47:36,937 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=307, Invalid=2558, Unknown=1, NotChecked=104, Total=2970 [2022-03-15 19:47:36,937 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 94 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:36,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 59 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:47:36,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2022-03-15 19:47:36,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 593. [2022-03-15 19:47:36,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 592 states have (on average 3.0320945945945947) internal successors, (1795), 592 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:36,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 1795 transitions. [2022-03-15 19:47:36,946 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 1795 transitions. Word has length 22 [2022-03-15 19:47:36,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:36,946 INFO L470 AbstractCegarLoop]: Abstraction has 593 states and 1795 transitions. [2022-03-15 19:47:36,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.75) internal successors, (35), 20 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:36,946 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 1795 transitions. [2022-03-15 19:47:36,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:47:36,948 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:36,948 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:36,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2022-03-15 19:47:37,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:37,150 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:47:37,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:37,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1846969583, now seen corresponding path program 49 times [2022-03-15 19:47:37,151 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:37,151 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380264788] [2022-03-15 19:47:37,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:37,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:37,618 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:37,619 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:37,619 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380264788] [2022-03-15 19:47:37,619 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380264788] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:47:37,619 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502818442] [2022-03-15 19:47:37,619 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:47:37,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:37,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:37,620 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:47:37,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-03-15 19:47:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:37,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 19:47:37,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:47:37,896 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:47:37,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:37,927 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-03-15 19:47:37,927 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 25 treesize of output 16 [2022-03-15 19:47:37,972 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-15 19:47:37,972 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502818442] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:47:37,972 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:47:37,972 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 4] total 20 [2022-03-15 19:47:37,972 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2003024502] [2022-03-15 19:47:37,972 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:37,974 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:37,981 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 56 transitions. [2022-03-15 19:47:37,981 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:38,619 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [73415#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0))), 73411#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 73412#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 73414#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)), 73413#(or (<= (+ 2 ~q_back~0) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))] [2022-03-15 19:47:38,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:47:38,619 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:38,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:47:38,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2022-03-15 19:47:38,619 INFO L87 Difference]: Start difference. First operand 593 states and 1795 transitions. Second operand has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 17 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:39,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:39,605 INFO L93 Difference]: Finished difference Result 756 states and 2171 transitions. [2022-03-15 19:47:39,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 19:47:39,605 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 17 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 22 [2022-03-15 19:47:39,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:39,607 INFO L225 Difference]: With dead ends: 756 [2022-03-15 19:47:39,608 INFO L226 Difference]: Without dead ends: 756 [2022-03-15 19:47:39,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=361, Invalid=1445, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 19:47:39,608 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 120 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:39,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 42 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:47:39,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2022-03-15 19:47:39,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 589. [2022-03-15 19:47:39,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 588 states have (on average 3.0306122448979593) internal successors, (1782), 588 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:39,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 1782 transitions. [2022-03-15 19:47:39,621 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 1782 transitions. Word has length 22 [2022-03-15 19:47:39,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:39,621 INFO L470 AbstractCegarLoop]: Abstraction has 589 states and 1782 transitions. [2022-03-15 19:47:39,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 17 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:39,621 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 1782 transitions. [2022-03-15 19:47:39,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:47:39,622 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:39,623 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:39,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2022-03-15 19:47:39,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2022-03-15 19:47:39,827 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:47:39,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:39,828 INFO L85 PathProgramCache]: Analyzing trace with hash 340247881, now seen corresponding path program 50 times [2022-03-15 19:47:39,828 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:39,828 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143071965] [2022-03-15 19:47:39,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:39,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:40,321 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:40,321 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:40,321 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143071965] [2022-03-15 19:47:40,321 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143071965] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:47:40,321 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232830727] [2022-03-15 19:47:40,321 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:47:40,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:40,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:40,323 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:47:40,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-03-15 19:47:40,479 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:47:40,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:47:40,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 36 conjunts are in the unsatisfiable core [2022-03-15 19:47:40,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:47:40,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:47:40,654 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:47:40,697 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:47:40,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:40,747 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2573 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2573) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset 4)) 0))) is different from false [2022-03-15 19:47:40,757 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:47:40,757 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 47 treesize of output 47 [2022-03-15 19:47:40,759 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2022-03-15 19:47:40,864 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 2 not checked. [2022-03-15 19:47:40,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232830727] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:47:40,864 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:47:40,864 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 7] total 29 [2022-03-15 19:47:40,864 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [917148274] [2022-03-15 19:47:40,864 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:40,866 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:40,871 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 40 transitions. [2022-03-15 19:47:40,871 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:41,123 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [75541#(or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)), 75540#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))] [2022-03-15 19:47:41,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:47:41,123 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:41,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:47:41,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=802, Unknown=1, NotChecked=58, Total=992 [2022-03-15 19:47:41,124 INFO L87 Difference]: Start difference. First operand 589 states and 1782 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:41,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:41,487 INFO L93 Difference]: Finished difference Result 698 states and 2057 transitions. [2022-03-15 19:47:41,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 19:47:41,487 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 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 22 [2022-03-15 19:47:41,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:41,489 INFO L225 Difference]: With dead ends: 698 [2022-03-15 19:47:41,489 INFO L226 Difference]: Without dead ends: 698 [2022-03-15 19:47:41,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=151, Invalid=974, Unknown=1, NotChecked=64, Total=1190 [2022-03-15 19:47:41,490 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 46 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:41,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 44 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:47:41,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2022-03-15 19:47:41,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 600. [2022-03-15 19:47:41,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 3.040066777963272) internal successors, (1821), 599 states have internal predecessors, (1821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:41,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 1821 transitions. [2022-03-15 19:47:41,502 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 1821 transitions. Word has length 22 [2022-03-15 19:47:41,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:41,502 INFO L470 AbstractCegarLoop]: Abstraction has 600 states and 1821 transitions. [2022-03-15 19:47:41,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:41,503 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 1821 transitions. [2022-03-15 19:47:41,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:47:41,504 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:41,504 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:41,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2022-03-15 19:47:41,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2022-03-15 19:47:41,725 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:47:41,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:41,726 INFO L85 PathProgramCache]: Analyzing trace with hash 974238975, now seen corresponding path program 51 times [2022-03-15 19:47:41,727 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:41,727 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698801450] [2022-03-15 19:47:41,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:41,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:42,320 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:42,320 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:42,320 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698801450] [2022-03-15 19:47:42,320 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698801450] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:47:42,320 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141050720] [2022-03-15 19:47:42,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:47:42,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:42,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:42,322 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:47:42,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-03-15 19:47:42,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:47:42,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:47:42,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 19:47:42,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:47:42,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:47:42,694 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:47:42,734 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:47:42,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:42,781 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2620 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2620) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset 4)) 0))) is different from false [2022-03-15 19:47:42,789 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:47:42,790 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 47 treesize of output 47 [2022-03-15 19:47:42,792 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 25 treesize of output 18 [2022-03-15 19:47:42,893 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:47:42,893 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141050720] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:47:42,893 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:47:42,893 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 25 [2022-03-15 19:47:42,893 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1525684646] [2022-03-15 19:47:42,893 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:42,895 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:42,900 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 34 transitions. [2022-03-15 19:47:42,900 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:43,110 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [77599#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 77598#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 77600#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))] [2022-03-15 19:47:43,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:47:43,111 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:43,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:47:43,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=647, Unknown=1, NotChecked=52, Total=812 [2022-03-15 19:47:43,111 INFO L87 Difference]: Start difference. First operand 600 states and 1821 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:43,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:43,654 INFO L93 Difference]: Finished difference Result 693 states and 2038 transitions. [2022-03-15 19:47:43,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 19:47:43,654 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 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 22 [2022-03-15 19:47:43,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:43,656 INFO L225 Difference]: With dead ends: 693 [2022-03-15 19:47:43,656 INFO L226 Difference]: Without dead ends: 693 [2022-03-15 19:47:43,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=179, Invalid=1084, Unknown=1, NotChecked=68, Total=1332 [2022-03-15 19:47:43,656 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 107 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:43,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 31 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:47:43,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2022-03-15 19:47:43,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 599. [2022-03-15 19:47:43,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 598 states have (on average 3.0434782608695654) internal successors, (1820), 598 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:43,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1820 transitions. [2022-03-15 19:47:43,665 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1820 transitions. Word has length 22 [2022-03-15 19:47:43,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:43,666 INFO L470 AbstractCegarLoop]: Abstraction has 599 states and 1820 transitions. [2022-03-15 19:47:43,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:43,666 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1820 transitions. [2022-03-15 19:47:43,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:47:43,667 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:43,667 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:43,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2022-03-15 19:47:43,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:43,867 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:47:43,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:43,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1830140275, now seen corresponding path program 52 times [2022-03-15 19:47:43,869 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:43,869 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471742298] [2022-03-15 19:47:43,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:43,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:44,356 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:44,356 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:44,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471742298] [2022-03-15 19:47:44,357 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471742298] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:47:44,357 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439553845] [2022-03-15 19:47:44,357 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:47:44,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:44,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:44,358 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:47:44,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-03-15 19:47:44,515 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:47:44,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:47:44,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 19:47:44,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:47:44,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:47:44,633 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:47:44,710 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:47:44,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:44,837 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:47:44,838 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 45 treesize of output 45 [2022-03-15 19:47:44,841 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 24 treesize of output 18 [2022-03-15 19:47:45,062 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:47:45,062 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439553845] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:47:45,062 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:47:45,062 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 24 [2022-03-15 19:47:45,062 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2076994975] [2022-03-15 19:47:45,062 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:45,064 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:45,068 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 30 transitions. [2022-03-15 19:47:45,068 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:45,791 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [79661#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)), 79660#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 79659#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= ~n~0 ~q_back~0) (< ~q_back~0 0))] [2022-03-15 19:47:45,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:47:45,791 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:45,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:47:45,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=612, Unknown=2, NotChecked=0, Total=756 [2022-03-15 19:47:45,792 INFO L87 Difference]: Start difference. First operand 599 states and 1820 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:46,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:46,277 INFO L93 Difference]: Finished difference Result 639 states and 1901 transitions. [2022-03-15 19:47:46,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 19:47:46,277 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 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 22 [2022-03-15 19:47:46,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:46,279 INFO L225 Difference]: With dead ends: 639 [2022-03-15 19:47:46,279 INFO L226 Difference]: Without dead ends: 637 [2022-03-15 19:47:46,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=175, Invalid=815, Unknown=2, NotChecked=0, Total=992 [2022-03-15 19:47:46,279 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 54 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:46,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 39 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:47:46,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2022-03-15 19:47:46,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 592. [2022-03-15 19:47:46,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 591 states have (on average 3.035532994923858) internal successors, (1794), 591 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:46,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 1794 transitions. [2022-03-15 19:47:46,288 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 1794 transitions. Word has length 22 [2022-03-15 19:47:46,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:46,288 INFO L470 AbstractCegarLoop]: Abstraction has 592 states and 1794 transitions. [2022-03-15 19:47:46,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:46,288 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 1794 transitions. [2022-03-15 19:47:46,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:47:46,289 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:46,289 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:46,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Ended with exit code 0 [2022-03-15 19:47:46,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-03-15 19:47:46,490 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:47:46,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:46,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1101458813, now seen corresponding path program 53 times [2022-03-15 19:47:46,491 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:46,491 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056770901] [2022-03-15 19:47:46,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:46,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:46,946 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:46,946 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:46,946 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056770901] [2022-03-15 19:47:46,946 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056770901] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:47:46,946 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571089225] [2022-03-15 19:47:46,946 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:47:46,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:46,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:46,947 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:47:46,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-03-15 19:47:47,112 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:47:47,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:47:47,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 19:47:47,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:47:47,198 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 12 treesize of output 3 [2022-03-15 19:47:47,265 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:47:47,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:47,295 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-03-15 19:47:47,296 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 25 treesize of output 16 [2022-03-15 19:47:47,332 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 12 treesize of output 4 [2022-03-15 19:47:47,347 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-15 19:47:47,347 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571089225] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:47:47,348 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:47:47,348 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 4] total 22 [2022-03-15 19:47:47,348 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [372087235] [2022-03-15 19:47:47,348 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:47,349 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:47,354 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 32 transitions. [2022-03-15 19:47:47,354 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:47,577 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [81644#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 81643#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 81642#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= ~n~0 ~q_back~0) (< ~q_back~0 0)), 81645#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0))] [2022-03-15 19:47:47,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:47:47,577 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:47,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:47:47,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:47:47,578 INFO L87 Difference]: Start difference. First operand 592 states and 1794 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:48,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:48,163 INFO L93 Difference]: Finished difference Result 686 states and 2036 transitions. [2022-03-15 19:47:48,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:47:48,163 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 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 22 [2022-03-15 19:47:48,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:48,165 INFO L225 Difference]: With dead ends: 686 [2022-03-15 19:47:48,165 INFO L226 Difference]: Without dead ends: 684 [2022-03-15 19:47:48,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=313, Invalid=1247, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 19:47:48,166 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 60 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:48,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 34 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:47:48,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2022-03-15 19:47:48,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 593. [2022-03-15 19:47:48,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 592 states have (on average 3.0388513513513513) internal successors, (1799), 592 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:48,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 1799 transitions. [2022-03-15 19:47:48,176 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 1799 transitions. Word has length 22 [2022-03-15 19:47:48,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:48,176 INFO L470 AbstractCegarLoop]: Abstraction has 593 states and 1799 transitions. [2022-03-15 19:47:48,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:48,176 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 1799 transitions. [2022-03-15 19:47:48,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:47:48,177 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:48,177 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:48,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2022-03-15 19:47:48,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2022-03-15 19:47:48,391 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:47:48,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:48,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1139569929, now seen corresponding path program 54 times [2022-03-15 19:47:48,392 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:48,392 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418908157] [2022-03-15 19:47:48,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:48,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:47:48,995 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:48,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418908157] [2022-03-15 19:47:48,995 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418908157] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:47:48,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679739154] [2022-03-15 19:47:48,995 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:47:48,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:48,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:48,996 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:47:48,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-03-15 19:47:49,386 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:47:49,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:47:49,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 19:47:49,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:47:49,525 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:47:49,564 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:47:49,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:49,647 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:47:49,647 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 40 treesize of output 32 [2022-03-15 19:47:49,747 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:47:49,747 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679739154] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:47:49,747 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:47:49,747 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 19 [2022-03-15 19:47:49,748 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1352940418] [2022-03-15 19:47:49,748 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:49,749 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:49,756 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 69 transitions. [2022-03-15 19:47:49,757 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:51,634 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [83693#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (<= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 83694#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (<= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 83695#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (<= ~N~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< 1 ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (<= ~N~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< 1 ~N~0) (<= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0))), 83691#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~s~0 ~N~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 83692#(and (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0)))] [2022-03-15 19:47:51,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:47:51,635 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:51,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:47:51,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2022-03-15 19:47:51,635 INFO L87 Difference]: Start difference. First operand 593 states and 1799 transitions. Second operand has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:52,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:52,781 INFO L93 Difference]: Finished difference Result 785 states and 2260 transitions. [2022-03-15 19:47:52,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:47:52,781 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:47:52,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:52,783 INFO L225 Difference]: With dead ends: 785 [2022-03-15 19:47:52,783 INFO L226 Difference]: Without dead ends: 760 [2022-03-15 19:47:52,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 9 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=290, Invalid=1042, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:47:52,784 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 73 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:52,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 45 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:47:52,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2022-03-15 19:47:52,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 603. [2022-03-15 19:47:52,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 602 states have (on average 3.03156146179402) internal successors, (1825), 602 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:52,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 1825 transitions. [2022-03-15 19:47:52,796 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 1825 transitions. Word has length 22 [2022-03-15 19:47:52,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:52,796 INFO L470 AbstractCegarLoop]: Abstraction has 603 states and 1825 transitions. [2022-03-15 19:47:52,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:52,796 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1825 transitions. [2022-03-15 19:47:52,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:47:52,797 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:52,797 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:52,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2022-03-15 19:47:53,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-03-15 19:47:53,021 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:47:53,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:53,021 INFO L85 PathProgramCache]: Analyzing trace with hash -429329449, now seen corresponding path program 55 times [2022-03-15 19:47:53,022 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:53,022 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480574640] [2022-03-15 19:47:53,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:53,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:53,718 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:53,719 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:53,719 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480574640] [2022-03-15 19:47:53,719 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480574640] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:47:53,719 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786720191] [2022-03-15 19:47:53,719 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:47:53,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:53,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:53,720 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:47:53,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-03-15 19:47:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:53,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 50 conjunts are in the unsatisfiable core [2022-03-15 19:47:53,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:47:54,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:47:54,153 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:47:54,202 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-03-15 19:47:54,249 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:47:54,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:54,318 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2814 (Array Int Int))) (<= (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2814) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset))) c_~N~0)) (forall ((v_ArrVal_2814 (Array Int Int))) (<= c_~N~0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2814) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)))))) is different from false [2022-03-15 19:47:54,377 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:47:54,377 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 82 treesize of output 74 [2022-03-15 19:47:54,382 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 53 treesize of output 47 [2022-03-15 19:47:54,386 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 47 treesize of output 41 [2022-03-15 19:47:54,641 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:47:54,642 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786720191] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:47:54,642 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:47:54,642 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 7] total 31 [2022-03-15 19:47:54,642 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [357432545] [2022-03-15 19:47:54,642 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:54,644 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:54,651 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 40 transitions. [2022-03-15 19:47:54,651 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:55,269 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [85868#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (<= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 85869#(and (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)))] [2022-03-15 19:47:55,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:47:55,269 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:55,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:47:55,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=963, Unknown=1, NotChecked=64, Total=1190 [2022-03-15 19:47:55,269 INFO L87 Difference]: Start difference. First operand 603 states and 1825 transitions. Second operand has 17 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:56,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:56,510 INFO L93 Difference]: Finished difference Result 665 states and 2012 transitions. [2022-03-15 19:47:56,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 19:47:56,510 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 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 22 [2022-03-15 19:47:56,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:56,511 INFO L225 Difference]: With dead ends: 665 [2022-03-15 19:47:56,512 INFO L226 Difference]: Without dead ends: 646 [2022-03-15 19:47:56,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=325, Invalid=1840, Unknown=1, NotChecked=90, Total=2256 [2022-03-15 19:47:56,512 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 87 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:56,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 55 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:47:56,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2022-03-15 19:47:56,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 597. [2022-03-15 19:47:56,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 3.0369127516778525) internal successors, (1810), 596 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:56,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1810 transitions. [2022-03-15 19:47:56,522 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1810 transitions. Word has length 22 [2022-03-15 19:47:56,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:56,522 INFO L470 AbstractCegarLoop]: Abstraction has 597 states and 1810 transitions. [2022-03-15 19:47:56,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:56,522 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1810 transitions. [2022-03-15 19:47:56,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:47:56,523 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:56,523 INFO L514 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:56,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2022-03-15 19:47:56,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable70 [2022-03-15 19:47:56,731 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:47:56,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:56,732 INFO L85 PathProgramCache]: Analyzing trace with hash 2125274644, now seen corresponding path program 13 times [2022-03-15 19:47:56,732 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:56,732 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076361618] [2022-03-15 19:47:56,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:56,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:57,177 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:47:57,177 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:57,177 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076361618] [2022-03-15 19:47:57,177 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076361618] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:47:57,177 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243704019] [2022-03-15 19:47:57,177 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:47:57,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:57,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:57,178 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:47:57,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-03-15 19:47:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:57,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 19:47:57,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:47:57,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:47:57,468 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:47:57,491 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 19:47:57,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:57,518 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2865 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2865) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) 0))) is different from false [2022-03-15 19:47:57,532 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:47:57,532 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 45 treesize of output 45 [2022-03-15 19:47:57,535 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-03-15 19:47:57,619 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 2 not checked. [2022-03-15 19:47:57,619 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243704019] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:47:57,619 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:47:57,619 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 5] total 22 [2022-03-15 19:47:57,619 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1845362531] [2022-03-15 19:47:57,619 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:57,621 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:57,625 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 34 transitions. [2022-03-15 19:47:57,625 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:57,761 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [87904#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))] [2022-03-15 19:47:57,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:47:57,762 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:57,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:47:57,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=418, Unknown=1, NotChecked=42, Total=552 [2022-03-15 19:47:57,762 INFO L87 Difference]: Start difference. First operand 597 states and 1810 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:58,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:58,067 INFO L93 Difference]: Finished difference Result 663 states and 1957 transitions. [2022-03-15 19:47:58,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 19:47:58,068 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 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 22 [2022-03-15 19:47:58,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:58,069 INFO L225 Difference]: With dead ends: 663 [2022-03-15 19:47:58,069 INFO L226 Difference]: Without dead ends: 663 [2022-03-15 19:47:58,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=769, Unknown=1, NotChecked=58, Total=992 [2022-03-15 19:47:58,069 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 48 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:58,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 31 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:47:58,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2022-03-15 19:47:58,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 583. [2022-03-15 19:47:58,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 582 states have (on average 3.0635738831615122) internal successors, (1783), 582 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:58,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 1783 transitions. [2022-03-15 19:47:58,079 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 1783 transitions. Word has length 22 [2022-03-15 19:47:58,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:58,080 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 1783 transitions. [2022-03-15 19:47:58,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:58,080 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 1783 transitions. [2022-03-15 19:47:58,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:47:58,081 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:58,081 INFO L514 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:58,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Ended with exit code 0 [2022-03-15 19:47:58,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:58,283 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:47:58,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:58,284 INFO L85 PathProgramCache]: Analyzing trace with hash -22391376, now seen corresponding path program 14 times [2022-03-15 19:47:58,284 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:58,284 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934906862] [2022-03-15 19:47:58,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:58,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:58,924 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:58,924 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:58,924 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934906862] [2022-03-15 19:47:58,924 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934906862] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:47:58,924 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782933057] [2022-03-15 19:47:58,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:47:58,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:58,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:58,925 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:47:58,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-03-15 19:47:59,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:47:59,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:47:59,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 19:47:59,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:47:59,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:47:59,233 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:47:59,268 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:47:59,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:59,300 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2916 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2916) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset)) 0))) is different from false [2022-03-15 19:47:59,310 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:47:59,311 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 45 treesize of output 45 [2022-03-15 19:47:59,313 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 24 treesize of output 18 [2022-03-15 19:47:59,398 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 1 not checked. [2022-03-15 19:47:59,398 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782933057] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:47:59,398 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:47:59,398 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 5] total 24 [2022-03-15 19:47:59,398 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1256791185] [2022-03-15 19:47:59,398 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:59,400 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:59,404 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 28 transitions. [2022-03-15 19:47:59,404 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:59,502 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [89901#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= ~n~0 ~q_back~0) (< ~q_back~0 0)), 89902#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))] [2022-03-15 19:47:59,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:47:59,502 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:59,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:47:59,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=554, Unknown=1, NotChecked=48, Total=702 [2022-03-15 19:47:59,503 INFO L87 Difference]: Start difference. First operand 583 states and 1783 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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 19:47:59,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:59,985 INFO L93 Difference]: Finished difference Result 681 states and 2021 transitions. [2022-03-15 19:47:59,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:47:59,986 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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 22 [2022-03-15 19:47:59,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:59,989 INFO L225 Difference]: With dead ends: 681 [2022-03-15 19:47:59,989 INFO L226 Difference]: Without dead ends: 679 [2022-03-15 19:47:59,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=174, Invalid=951, Unknown=1, NotChecked=64, Total=1190 [2022-03-15 19:47:59,989 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 56 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:59,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 38 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:47:59,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2022-03-15 19:47:59,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 589. [2022-03-15 19:47:59,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 588 states have (on average 3.052721088435374) internal successors, (1795), 588 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:59,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 1795 transitions. [2022-03-15 19:47:59,999 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 1795 transitions. Word has length 22 [2022-03-15 19:47:59,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:59,999 INFO L470 AbstractCegarLoop]: Abstraction has 589 states and 1795 transitions. [2022-03-15 19:48:00,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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 19:48:00,000 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 1795 transitions. [2022-03-15 19:48:00,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:48:00,001 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:48:00,001 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:48:00,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Forceful destruction successful, exit code 0 [2022-03-15 19:48:00,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:00,215 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:48:00,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:48:00,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1276236278, now seen corresponding path program 56 times [2022-03-15 19:48:00,216 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:48:00,216 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813493001] [2022-03-15 19:48:00,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:48:00,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:48:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:48:00,449 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:00,449 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:48:00,449 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813493001] [2022-03-15 19:48:00,449 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813493001] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:48:00,449 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434309098] [2022-03-15 19:48:00,449 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:48:00,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:00,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:48:00,450 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:48:00,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-03-15 19:48:00,618 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:48:00,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:48:00,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 36 conjunts are in the unsatisfiable core [2022-03-15 19:48:00,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:48:00,907 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:00,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:48:00,972 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-03-15 19:48:00,972 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 25 treesize of output 16 [2022-03-15 19:48:01,316 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:01,316 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434309098] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:48:01,317 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:48:01,317 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2022-03-15 19:48:01,317 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1898057667] [2022-03-15 19:48:01,317 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:48:01,318 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:48:01,327 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 68 transitions. [2022-03-15 19:48:01,327 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:48:02,312 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [91952#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (< ~q_front~0 0)), 91954#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ 3 ~q_back~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 12)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0)), 91951#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)), 91953#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0))), 91950#(or (<= (+ 2 ~q_back~0) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 91948#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 91949#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))] [2022-03-15 19:48:02,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:48:02,313 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:48:02,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:48:02,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=1594, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:48:02,313 INFO L87 Difference]: Start difference. First operand 589 states and 1795 transitions. Second operand has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:03,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:48:03,741 INFO L93 Difference]: Finished difference Result 822 states and 2331 transitions. [2022-03-15 19:48:03,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 19:48:03,741 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 0 states have call successors, (0), 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 23 [2022-03-15 19:48:03,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:48:03,743 INFO L225 Difference]: With dead ends: 822 [2022-03-15 19:48:03,743 INFO L226 Difference]: Without dead ends: 818 [2022-03-15 19:48:03,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=907, Invalid=3383, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 19:48:03,744 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 184 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:48:03,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 73 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:48:03,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2022-03-15 19:48:03,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 595. [2022-03-15 19:48:03,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 594 states have (on average 3.063973063973064) internal successors, (1820), 594 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:03,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 1820 transitions. [2022-03-15 19:48:03,751 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 1820 transitions. Word has length 23 [2022-03-15 19:48:03,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:48:03,751 INFO L470 AbstractCegarLoop]: Abstraction has 595 states and 1820 transitions. [2022-03-15 19:48:03,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:03,751 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1820 transitions. [2022-03-15 19:48:03,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:48:03,752 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:48:03,752 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:48:03,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Ended with exit code 0 [2022-03-15 19:48:03,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:03,953 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:48:03,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:48:03,953 INFO L85 PathProgramCache]: Analyzing trace with hash 356728424, now seen corresponding path program 57 times [2022-03-15 19:48:03,954 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:48:03,954 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949817695] [2022-03-15 19:48:03,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:48:03,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:48:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:48:04,287 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:04,287 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:48:04,287 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949817695] [2022-03-15 19:48:04,288 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949817695] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:48:04,288 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843549882] [2022-03-15 19:48:04,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:48:04,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:04,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:48:04,289 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:48:04,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-03-15 19:48:04,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:48:04,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:48:04,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 40 conjunts are in the unsatisfiable core [2022-03-15 19:48:04,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:48:04,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:48:04,742 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:48:04,891 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:04,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:48:05,119 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:48:05,120 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 47 treesize of output 47 [2022-03-15 19:48:05,123 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 25 treesize of output 18 [2022-03-15 19:48:05,667 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:05,667 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843549882] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:48:05,667 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:48:05,668 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2022-03-15 19:48:05,668 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [339947576] [2022-03-15 19:48:05,668 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:48:05,669 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:48:05,675 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 47 transitions. [2022-03-15 19:48:05,675 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:48:06,066 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [94182#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 94183#(or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)), 94184#(or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0)))] [2022-03-15 19:48:06,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:48:06,066 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:48:06,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:48:06,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1667, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 19:48:06,067 INFO L87 Difference]: Start difference. First operand 595 states and 1820 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 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 19:48:07,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:48:07,863 INFO L93 Difference]: Finished difference Result 974 states and 2892 transitions. [2022-03-15 19:48:07,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 19:48:07,863 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 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 23 [2022-03-15 19:48:07,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:48:07,865 INFO L225 Difference]: With dead ends: 974 [2022-03-15 19:48:07,865 INFO L226 Difference]: Without dead ends: 974 [2022-03-15 19:48:07,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 777 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=758, Invalid=3934, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 19:48:07,866 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 67 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 1358 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:48:07,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 63 Invalid, 1396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1358 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:48:07,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2022-03-15 19:48:07,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 633. [2022-03-15 19:48:07,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 632 states have (on average 3.106012658227848) internal successors, (1963), 632 states have internal predecessors, (1963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:07,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1963 transitions. [2022-03-15 19:48:07,879 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 1963 transitions. Word has length 23 [2022-03-15 19:48:07,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:48:07,879 INFO L470 AbstractCegarLoop]: Abstraction has 633 states and 1963 transitions. [2022-03-15 19:48:07,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 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 19:48:07,879 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1963 transitions. [2022-03-15 19:48:07,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:48:07,880 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:48:07,880 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:48:07,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Forceful destruction successful, exit code 0 [2022-03-15 19:48:08,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable74 [2022-03-15 19:48:08,095 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:48:08,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:48:08,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1464384142, now seen corresponding path program 58 times [2022-03-15 19:48:08,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:48:08,097 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720324571] [2022-03-15 19:48:08,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:48:08,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:48:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:48:08,432 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:08,433 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:48:08,433 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720324571] [2022-03-15 19:48:08,433 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720324571] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:48:08,433 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989968964] [2022-03-15 19:48:08,433 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:48:08,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:08,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:48:08,434 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:48:08,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-03-15 19:48:08,635 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:48:08,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:48:08,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 19:48:08,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:48:08,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:48:08,915 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:48:09,115 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:09,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:48:09,294 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:48:09,294 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 47 treesize of output 47 [2022-03-15 19:48:09,296 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 25 treesize of output 18 [2022-03-15 19:48:09,801 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:09,801 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989968964] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:48:09,803 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:48:09,803 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2022-03-15 19:48:09,803 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1474573774] [2022-03-15 19:48:09,803 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:48:09,806 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:48:09,812 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 41 transitions. [2022-03-15 19:48:09,813 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:48:10,170 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [96651#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)), 96648#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 96649#(or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)), 96650#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))] [2022-03-15 19:48:10,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:48:10,171 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:48:10,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:48:10,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1687, Unknown=4, NotChecked=0, Total=1980 [2022-03-15 19:48:10,172 INFO L87 Difference]: Start difference. First operand 633 states and 1963 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 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 19:48:10,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:48:10,789 INFO L93 Difference]: Finished difference Result 1054 states and 3050 transitions. [2022-03-15 19:48:10,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 19:48:10,789 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 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 23 [2022-03-15 19:48:10,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:48:10,791 INFO L225 Difference]: With dead ends: 1054 [2022-03-15 19:48:10,791 INFO L226 Difference]: Without dead ends: 1034 [2022-03-15 19:48:10,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=435, Invalid=2317, Unknown=4, NotChecked=0, Total=2756 [2022-03-15 19:48:10,792 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 109 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:48:10,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 59 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:48:10,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2022-03-15 19:48:10,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 677. [2022-03-15 19:48:10,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 676 states have (on average 3.1508875739644973) internal successors, (2130), 676 states have internal predecessors, (2130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:10,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 2130 transitions. [2022-03-15 19:48:10,802 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 2130 transitions. Word has length 23 [2022-03-15 19:48:10,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:48:10,802 INFO L470 AbstractCegarLoop]: Abstraction has 677 states and 2130 transitions. [2022-03-15 19:48:10,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 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 19:48:10,802 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 2130 transitions. [2022-03-15 19:48:10,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:48:10,803 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:48:10,804 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:48:10,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Ended with exit code 0 [2022-03-15 19:48:11,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:11,015 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:48:11,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:48:11,015 INFO L85 PathProgramCache]: Analyzing trace with hash 2085880656, now seen corresponding path program 59 times [2022-03-15 19:48:11,016 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:48:11,016 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067588200] [2022-03-15 19:48:11,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:48:11,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:48:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:48:11,361 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:11,361 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:48:11,361 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067588200] [2022-03-15 19:48:11,362 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067588200] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:48:11,362 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114926527] [2022-03-15 19:48:11,362 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:48:11,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:11,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:48:11,363 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:48:11,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-03-15 19:48:11,536 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:48:11,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:48:11,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 19:48:11,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:48:11,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:48:11,779 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:48:11,922 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:11,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:48:12,091 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:48:12,091 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 47 treesize of output 47 [2022-03-15 19:48:12,097 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2022-03-15 19:48:12,462 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:12,463 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114926527] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:48:12,463 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:48:12,463 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 39 [2022-03-15 19:48:12,463 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1119332634] [2022-03-15 19:48:12,463 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:48:12,465 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:48:12,471 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 37 transitions. [2022-03-15 19:48:12,471 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:48:12,791 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [99250#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)), 99251#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)), 99248#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 99249#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))] [2022-03-15 19:48:12,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:48:12,792 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:48:12,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:48:12,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1587, Unknown=12, NotChecked=0, Total=1892 [2022-03-15 19:48:12,792 INFO L87 Difference]: Start difference. First operand 677 states and 2130 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 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 19:48:13,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:48:13,497 INFO L93 Difference]: Finished difference Result 1096 states and 3274 transitions. [2022-03-15 19:48:13,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:48:13,497 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 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 23 [2022-03-15 19:48:13,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:48:13,499 INFO L225 Difference]: With dead ends: 1096 [2022-03-15 19:48:13,499 INFO L226 Difference]: Without dead ends: 1088 [2022-03-15 19:48:13,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=452, Invalid=2187, Unknown=13, NotChecked=0, Total=2652 [2022-03-15 19:48:13,500 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 121 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:48:13,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 57 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:48:13,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2022-03-15 19:48:13,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 814. [2022-03-15 19:48:13,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 813 states have (on average 3.1943419434194342) internal successors, (2597), 813 states have internal predecessors, (2597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:13,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 2597 transitions. [2022-03-15 19:48:13,511 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 2597 transitions. Word has length 23 [2022-03-15 19:48:13,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:48:13,511 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 2597 transitions. [2022-03-15 19:48:13,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 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 19:48:13,512 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 2597 transitions. [2022-03-15 19:48:13,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:48:13,513 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:48:13,513 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:48:13,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Forceful destruction successful, exit code 0 [2022-03-15 19:48:13,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:13,713 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:48:13,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:48:13,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1353185340, now seen corresponding path program 60 times [2022-03-15 19:48:13,714 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:48:13,714 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662123609] [2022-03-15 19:48:13,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:48:13,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:48:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:48:14,274 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:14,274 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:48:14,274 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662123609] [2022-03-15 19:48:14,274 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662123609] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:48:14,274 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129176525] [2022-03-15 19:48:14,274 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:48:14,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:14,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:48:14,275 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:48:14,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-03-15 19:48:14,449 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:48:14,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:48:14,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 52 conjunts are in the unsatisfiable core [2022-03-15 19:48:14,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:48:14,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:48:14,683 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:48:14,800 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:14,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:48:15,015 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:48:15,015 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 47 treesize of output 47 [2022-03-15 19:48:15,018 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 25 treesize of output 18 [2022-03-15 19:48:15,414 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:15,414 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129176525] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:48:15,414 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:48:15,414 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 40 [2022-03-15 19:48:15,414 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2140319261] [2022-03-15 19:48:15,414 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:48:15,416 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:48:15,421 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 33 transitions. [2022-03-15 19:48:15,421 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:48:15,702 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [102165#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= ~n~0 ~q_back~0) (< ~q_back~0 0)), 102168#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))), 102167#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)), 102166#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))] [2022-03-15 19:48:15,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:48:15,703 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:48:15,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:48:15,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=1589, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:48:15,703 INFO L87 Difference]: Start difference. First operand 814 states and 2597 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 19 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 19:48:16,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:48:16,711 INFO L93 Difference]: Finished difference Result 781 states and 2098 transitions. [2022-03-15 19:48:16,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 19:48:16,711 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 19 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 23 [2022-03-15 19:48:16,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:48:16,712 INFO L225 Difference]: With dead ends: 781 [2022-03-15 19:48:16,712 INFO L226 Difference]: Without dead ends: 673 [2022-03-15 19:48:16,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=590, Invalid=2602, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 19:48:16,713 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 95 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:48:16,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 67 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:48:16,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2022-03-15 19:48:16,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 537. [2022-03-15 19:48:16,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 2.916044776119403) internal successors, (1563), 536 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:16,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 1563 transitions. [2022-03-15 19:48:16,720 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 1563 transitions. Word has length 23 [2022-03-15 19:48:16,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:48:16,720 INFO L470 AbstractCegarLoop]: Abstraction has 537 states and 1563 transitions. [2022-03-15 19:48:16,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 19 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 19:48:16,720 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 1563 transitions. [2022-03-15 19:48:16,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:48:16,721 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:48:16,721 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:48:16,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Forceful destruction successful, exit code 0 [2022-03-15 19:48:16,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable77 [2022-03-15 19:48:16,921 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:48:16,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:48:16,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1716294312, now seen corresponding path program 61 times [2022-03-15 19:48:16,922 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:48:16,922 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736981156] [2022-03-15 19:48:16,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:48:16,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:48:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:48:17,132 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:17,132 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:48:17,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736981156] [2022-03-15 19:48:17,133 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736981156] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:48:17,133 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285821053] [2022-03-15 19:48:17,133 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:48:17,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:17,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:48:17,135 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:48:17,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-03-15 19:48:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:48:17,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 36 conjunts are in the unsatisfiable core [2022-03-15 19:48:17,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:48:17,621 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:17,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:48:17,703 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-03-15 19:48:17,703 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 26 treesize of output 18 [2022-03-15 19:48:18,023 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:18,024 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285821053] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:48:18,024 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:48:18,024 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2022-03-15 19:48:18,024 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1761822106] [2022-03-15 19:48:18,024 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:48:18,026 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:48:18,033 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 43 transitions. [2022-03-15 19:48:18,034 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:48:18,483 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [104222#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0)), 104221#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)), 104220#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)), 104219#(or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)), 104218#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))] [2022-03-15 19:48:18,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:48:18,483 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:48:18,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:48:18,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=1493, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 19:48:18,484 INFO L87 Difference]: Start difference. First operand 537 states and 1563 transitions. Second operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:19,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:48:19,285 INFO L93 Difference]: Finished difference Result 789 states and 2106 transitions. [2022-03-15 19:48:19,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:48:19,285 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 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 23 [2022-03-15 19:48:19,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:48:19,286 INFO L225 Difference]: With dead ends: 789 [2022-03-15 19:48:19,286 INFO L226 Difference]: Without dead ends: 781 [2022-03-15 19:48:19,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=563, Invalid=2407, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 19:48:19,287 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 79 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:48:19,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 62 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:48:19,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2022-03-15 19:48:19,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 421. [2022-03-15 19:48:19,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 2.669047619047619) internal successors, (1121), 420 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:19,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1121 transitions. [2022-03-15 19:48:19,293 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1121 transitions. Word has length 23 [2022-03-15 19:48:19,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:48:19,293 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 1121 transitions. [2022-03-15 19:48:19,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:19,294 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1121 transitions. [2022-03-15 19:48:19,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:48:19,294 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:48:19,294 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:48:19,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Forceful destruction successful, exit code 0 [2022-03-15 19:48:19,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2022-03-15 19:48:19,495 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:48:19,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:48:19,495 INFO L85 PathProgramCache]: Analyzing trace with hash 971591814, now seen corresponding path program 62 times [2022-03-15 19:48:19,496 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:48:19,496 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315327066] [2022-03-15 19:48:19,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:48:19,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:48:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:48:19,791 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:19,791 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:48:19,791 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315327066] [2022-03-15 19:48:19,791 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315327066] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:48:19,791 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305632781] [2022-03-15 19:48:19,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:48:19,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:19,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:48:19,793 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:48:19,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-03-15 19:48:19,993 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:48:19,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:48:19,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 19:48:19,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:48:20,315 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:20,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:48:20,431 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-03-15 19:48:20,435 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 26 treesize of output 18 [2022-03-15 19:48:20,852 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:20,852 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305632781] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:48:20,852 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:48:20,853 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2022-03-15 19:48:20,853 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1583377496] [2022-03-15 19:48:20,853 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:48:20,854 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:48:20,860 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 39 transitions. [2022-03-15 19:48:20,860 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:48:21,239 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [106049#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 106048#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 106050#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)), 106052#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0)), 106051#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0))] [2022-03-15 19:48:21,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:48:21,239 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:48:21,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:48:21,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=1485, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 19:48:21,240 INFO L87 Difference]: Start difference. First operand 421 states and 1121 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 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 19:48:22,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:48:22,006 INFO L93 Difference]: Finished difference Result 618 states and 1511 transitions. [2022-03-15 19:48:22,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:48:22,007 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 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 23 [2022-03-15 19:48:22,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:48:22,008 INFO L225 Difference]: With dead ends: 618 [2022-03-15 19:48:22,008 INFO L226 Difference]: Without dead ends: 606 [2022-03-15 19:48:22,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=575, Invalid=2395, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 19:48:22,008 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 86 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:48:22,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 51 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:48:22,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2022-03-15 19:48:22,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 413. [2022-03-15 19:48:22,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 2.6674757281553396) internal successors, (1099), 412 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:22,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 1099 transitions. [2022-03-15 19:48:22,014 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 1099 transitions. Word has length 23 [2022-03-15 19:48:22,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:48:22,014 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 1099 transitions. [2022-03-15 19:48:22,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 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 19:48:22,014 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 1099 transitions. [2022-03-15 19:48:22,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:48:22,015 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:48:22,015 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:48:22,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Forceful destruction successful, exit code 0 [2022-03-15 19:48:22,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:22,215 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:48:22,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:48:22,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1492458724, now seen corresponding path program 63 times [2022-03-15 19:48:22,217 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:48:22,217 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367840599] [2022-03-15 19:48:22,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:48:22,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:48:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:48:22,459 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:22,459 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:48:22,459 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367840599] [2022-03-15 19:48:22,459 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367840599] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:48:22,459 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619319936] [2022-03-15 19:48:22,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:48:22,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:22,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:48:22,460 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:48:22,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2022-03-15 19:48:22,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:48:22,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:48:22,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 19:48:22,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:48:22,967 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:22,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:48:23,070 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-03-15 19:48:23,070 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 26 treesize of output 18 [2022-03-15 19:48:23,443 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:23,443 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619319936] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:48:23,443 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:48:23,444 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2022-03-15 19:48:23,444 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1941275354] [2022-03-15 19:48:23,444 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:48:23,445 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:48:23,453 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 65 transitions. [2022-03-15 19:48:23,453 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:48:24,215 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [107694#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)), 107692#(or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)), 107695#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0)), 107691#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 107693#(or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0)))] [2022-03-15 19:48:24,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:48:24,215 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:48:24,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:48:24,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=1522, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 19:48:24,215 INFO L87 Difference]: Start difference. First operand 413 states and 1099 transitions. Second operand has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:25,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:48:25,164 INFO L93 Difference]: Finished difference Result 552 states and 1427 transitions. [2022-03-15 19:48:25,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 19:48:25,165 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 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 23 [2022-03-15 19:48:25,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:48:25,166 INFO L225 Difference]: With dead ends: 552 [2022-03-15 19:48:25,166 INFO L226 Difference]: Without dead ends: 552 [2022-03-15 19:48:25,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=519, Invalid=2787, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 19:48:25,166 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 54 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:48:25,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 63 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:48:25,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2022-03-15 19:48:25,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 403. [2022-03-15 19:48:25,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 402 states have (on average 2.674129353233831) internal successors, (1075), 402 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:25,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 1075 transitions. [2022-03-15 19:48:25,171 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 1075 transitions. Word has length 23 [2022-03-15 19:48:25,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:48:25,171 INFO L470 AbstractCegarLoop]: Abstraction has 403 states and 1075 transitions. [2022-03-15 19:48:25,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:25,171 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 1075 transitions. [2022-03-15 19:48:25,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:48:25,172 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:48:25,172 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:48:25,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Ended with exit code 0 [2022-03-15 19:48:25,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:25,373 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:48:25,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:48:25,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1008978288, now seen corresponding path program 64 times [2022-03-15 19:48:25,374 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:48:25,374 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283776979] [2022-03-15 19:48:25,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:48:25,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:48:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:48:28,023 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 19:48:28,023 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:48:28,023 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283776979] [2022-03-15 19:48:28,023 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283776979] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:48:28,023 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631231881] [2022-03-15 19:48:28,023 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:48:28,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:28,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:48:28,024 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:48:28,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2022-03-15 19:48:28,209 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:48:28,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:48:28,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 46 conjunts are in the unsatisfiable core [2022-03-15 19:48:28,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:48:28,418 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:48:28,419 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 12 [2022-03-15 19:48:28,483 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:48:28,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:48:28,679 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:48:28,679 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 78 [2022-03-15 19:48:28,803 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:48:28,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631231881] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:48:28,803 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:48:28,803 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 26 [2022-03-15 19:48:28,803 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [152862582] [2022-03-15 19:48:28,803 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:48:28,805 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:48:28,826 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 63 transitions. [2022-03-15 19:48:28,826 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:48:31,077 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [109250#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 1) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ 2 ~q_back~0)) (< 2 ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 1) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0)) (< 2 ~N~0))), 109247#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 109245#(and (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0))), 109244#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 109246#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 109248#(and (or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 109249#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ 2 ~q_back~0))))] [2022-03-15 19:48:31,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:48:31,077 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:48:31,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:48:31,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1003, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:48:31,078 INFO L87 Difference]: Start difference. First operand 403 states and 1075 transitions. Second operand has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:35,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:48:35,010 INFO L93 Difference]: Finished difference Result 668 states and 1664 transitions. [2022-03-15 19:48:35,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 19:48:35,010 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 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 23 [2022-03-15 19:48:35,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:48:35,011 INFO L225 Difference]: With dead ends: 668 [2022-03-15 19:48:35,011 INFO L226 Difference]: Without dead ends: 642 [2022-03-15 19:48:35,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 35 SyntacticMatches, 9 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=484, Invalid=2486, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 19:48:35,012 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 173 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:48:35,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 53 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:48:35,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2022-03-15 19:48:35,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 445. [2022-03-15 19:48:35,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 2.7274774774774775) internal successors, (1211), 444 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:35,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1211 transitions. [2022-03-15 19:48:35,018 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1211 transitions. Word has length 23 [2022-03-15 19:48:35,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:48:35,018 INFO L470 AbstractCegarLoop]: Abstraction has 445 states and 1211 transitions. [2022-03-15 19:48:35,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:35,018 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1211 transitions. [2022-03-15 19:48:35,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:48:35,019 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:48:35,019 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:48:35,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Forceful destruction successful, exit code 0 [2022-03-15 19:48:35,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable81 [2022-03-15 19:48:35,235 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:48:35,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:48:35,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1753680786, now seen corresponding path program 65 times [2022-03-15 19:48:35,236 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:48:35,236 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440937901] [2022-03-15 19:48:35,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:48:35,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:48:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:48:36,606 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 19:48:36,607 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:48:36,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440937901] [2022-03-15 19:48:36,607 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440937901] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:48:36,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663488589] [2022-03-15 19:48:36,607 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:48:36,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:36,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:48:36,608 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:48:36,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2022-03-15 19:48:36,799 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:48:36,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:48:36,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 57 conjunts are in the unsatisfiable core [2022-03-15 19:48:36,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:48:37,052 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:48:37,052 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 22 [2022-03-15 19:48:37,141 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:48:37,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:48:37,355 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:48:37,355 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 89 treesize of output 81 [2022-03-15 19:48:37,495 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:48:37,495 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663488589] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:48:37,495 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:48:37,495 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 7] total 30 [2022-03-15 19:48:37,495 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1053514824] [2022-03-15 19:48:37,495 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:48:37,497 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:48:37,505 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 59 transitions. [2022-03-15 19:48:37,505 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:48:39,655 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [111018#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0)))), 111017#(and (or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 111013#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 111015#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 111016#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 111019#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 1) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0)) (< 2 ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 1) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0)) (< 2 ~N~0))), 111014#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))))] [2022-03-15 19:48:39,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:48:39,656 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:48:39,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:48:39,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1279, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:48:39,656 INFO L87 Difference]: Start difference. First operand 445 states and 1211 transitions. Second operand has 23 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:44,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:48:44,497 INFO L93 Difference]: Finished difference Result 739 states and 1817 transitions. [2022-03-15 19:48:44,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 19:48:44,497 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 states have internal predecessors, (47), 0 states have call successors, (0), 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 23 [2022-03-15 19:48:44,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:48:44,498 INFO L225 Difference]: With dead ends: 739 [2022-03-15 19:48:44,498 INFO L226 Difference]: Without dead ends: 719 [2022-03-15 19:48:44,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 29 SyntacticMatches, 9 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=538, Invalid=3368, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 19:48:44,499 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 197 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:48:44,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 63 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:48:44,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2022-03-15 19:48:44,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 467. [2022-03-15 19:48:44,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 466 states have (on average 2.763948497854077) internal successors, (1288), 466 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:44,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 1288 transitions. [2022-03-15 19:48:44,505 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 1288 transitions. Word has length 23 [2022-03-15 19:48:44,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:48:44,506 INFO L470 AbstractCegarLoop]: Abstraction has 467 states and 1288 transitions. [2022-03-15 19:48:44,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:44,506 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 1288 transitions. [2022-03-15 19:48:44,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:48:44,506 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:48:44,506 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:48:44,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Ended with exit code 0 [2022-03-15 19:48:44,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:44,707 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:48:44,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:48:44,707 INFO L85 PathProgramCache]: Analyzing trace with hash 77235972, now seen corresponding path program 66 times [2022-03-15 19:48:44,708 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:48:44,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411652992] [2022-03-15 19:48:44,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:48:44,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:48:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:48:46,612 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 19:48:46,613 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:48:46,613 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411652992] [2022-03-15 19:48:46,613 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411652992] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:48:46,613 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511124582] [2022-03-15 19:48:46,613 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:48:46,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:46,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:48:46,614 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:48:46,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2022-03-15 19:48:46,839 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:48:46,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:48:46,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 19:48:46,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:48:47,052 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:48:47,052 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 14 [2022-03-15 19:48:47,100 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:48:47,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:48:47,306 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:48:47,306 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 81 [2022-03-15 19:48:47,425 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:48:47,425 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511124582] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:48:47,425 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:48:47,425 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7, 7] total 27 [2022-03-15 19:48:47,425 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1894184786] [2022-03-15 19:48:47,425 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:48:47,427 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:48:47,436 INFO L252 McrAutomatonBuilder]: Finished intersection with 53 states and 85 transitions. [2022-03-15 19:48:47,436 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:48:50,567 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [112905#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)) (or (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 112907#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0)))), 112904#(and (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0)))), 112906#(and (or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 112902#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 112903#(and (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)))), 112908#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 1) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0)) (< 2 ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 1) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0)) (< 2 ~N~0)))] [2022-03-15 19:48:50,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 19:48:50,568 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:48:50,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 19:48:50,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1057, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:48:50,568 INFO L87 Difference]: Start difference. First operand 467 states and 1288 transitions. Second operand has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:54,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:48:54,927 INFO L93 Difference]: Finished difference Result 721 states and 1877 transitions. [2022-03-15 19:48:54,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 19:48:54,928 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:48:54,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:48:54,929 INFO L225 Difference]: With dead ends: 721 [2022-03-15 19:48:54,929 INFO L226 Difference]: Without dead ends: 675 [2022-03-15 19:48:54,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 44 SyntacticMatches, 9 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=614, Invalid=2692, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 19:48:54,929 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 162 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:48:54,929 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 85 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:48:54,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2022-03-15 19:48:54,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 488. [2022-03-15 19:48:54,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 487 states have (on average 2.7659137577002055) internal successors, (1347), 487 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:54,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 1347 transitions. [2022-03-15 19:48:54,936 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 1347 transitions. Word has length 23 [2022-03-15 19:48:54,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:48:54,936 INFO L470 AbstractCegarLoop]: Abstraction has 488 states and 1347 transitions. [2022-03-15 19:48:54,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:54,936 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 1347 transitions. [2022-03-15 19:48:54,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:48:54,937 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:48:54,937 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:48:54,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Ended with exit code 0 [2022-03-15 19:48:55,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:55,149 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:48:55,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:48:55,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1533704986, now seen corresponding path program 67 times [2022-03-15 19:48:55,150 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:48:55,150 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273981236] [2022-03-15 19:48:55,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:48:55,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:48:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:48:56,577 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 19:48:56,578 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:48:56,578 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273981236] [2022-03-15 19:48:56,578 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273981236] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:48:56,578 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391523181] [2022-03-15 19:48:56,578 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:48:56,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:56,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:48:56,579 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:48:56,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2022-03-15 19:48:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:48:56,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 57 conjunts are in the unsatisfiable core [2022-03-15 19:48:56,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:48:57,062 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:48:57,062 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 12 [2022-03-15 19:48:57,142 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:48:57,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:48:57,351 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:48:57,351 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 81 [2022-03-15 19:48:57,486 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:48:57,486 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391523181] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:48:57,486 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:48:57,486 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 7] total 30 [2022-03-15 19:48:57,487 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [984874368] [2022-03-15 19:48:57,487 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:48:57,488 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:48:57,496 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 70 transitions. [2022-03-15 19:48:57,497 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:00,052 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [114815#(and (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0))), 114819#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ 2 ~q_back~0)))), 114820#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 1) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ 2 ~q_back~0)) (< 2 ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 1) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0)) (< 2 ~N~0))), 114816#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 114818#(and (or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 114817#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)))), 114814#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))))] [2022-03-15 19:49:00,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:49:00,052 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:00,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:49:00,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1258, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:49:00,053 INFO L87 Difference]: Start difference. First operand 488 states and 1347 transitions. Second operand has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:03,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:03,923 INFO L93 Difference]: Finished difference Result 672 states and 1701 transitions. [2022-03-15 19:49:03,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 19:49:03,924 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 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 23 [2022-03-15 19:49:03,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:03,925 INFO L225 Difference]: With dead ends: 672 [2022-03-15 19:49:03,925 INFO L226 Difference]: Without dead ends: 646 [2022-03-15 19:49:03,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 32 SyntacticMatches, 11 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=578, Invalid=2962, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 19:49:03,925 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 154 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:03,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 68 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:49:03,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2022-03-15 19:49:03,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 492. [2022-03-15 19:49:03,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 491 states have (on average 2.7637474541751526) internal successors, (1357), 491 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:03,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 1357 transitions. [2022-03-15 19:49:03,931 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 1357 transitions. Word has length 23 [2022-03-15 19:49:03,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:03,931 INFO L470 AbstractCegarLoop]: Abstraction has 492 states and 1357 transitions. [2022-03-15 19:49:03,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:03,931 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 1357 transitions. [2022-03-15 19:49:03,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:49:03,932 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:03,932 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:03,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Forceful destruction successful, exit code 0 [2022-03-15 19:49:04,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable84 [2022-03-15 19:49:04,133 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:04,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:04,133 INFO L85 PathProgramCache]: Analyzing trace with hash 2016559812, now seen corresponding path program 68 times [2022-03-15 19:49:04,134 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:04,134 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97523459] [2022-03-15 19:49:04,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:04,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:04,820 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 19:49:04,820 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:04,820 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97523459] [2022-03-15 19:49:04,820 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97523459] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:04,820 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498013132] [2022-03-15 19:49:04,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:49:04,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:04,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:04,822 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:04,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2022-03-15 19:49:05,010 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:49:05,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:49:05,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 57 conjunts are in the unsatisfiable core [2022-03-15 19:49:05,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:05,275 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:49:05,275 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 22 [2022-03-15 19:49:05,345 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:49:05,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:05,558 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:49:05,559 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 89 treesize of output 81 [2022-03-15 19:49:05,679 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:49:05,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498013132] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:05,679 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:05,679 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 7] total 30 [2022-03-15 19:49:05,680 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [339636265] [2022-03-15 19:49:05,680 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:05,681 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:05,690 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 66 transitions. [2022-03-15 19:49:05,690 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:07,971 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [116687#(and (or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 116684#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (< ~s~0 (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~N~0 ~s~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 116683#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 116685#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 116686#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)))), 116688#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ 2 ~q_back~0)))), 116689#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 1) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ 2 ~q_back~0)) (< 2 ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 1) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0)) (< 2 ~N~0)))] [2022-03-15 19:49:07,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:49:07,971 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:07,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:49:07,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1285, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:49:07,972 INFO L87 Difference]: Start difference. First operand 492 states and 1357 transitions. Second operand has 23 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:12,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:12,228 INFO L93 Difference]: Finished difference Result 696 states and 1752 transitions. [2022-03-15 19:49:12,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 19:49:12,228 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:49:12,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:12,230 INFO L225 Difference]: With dead ends: 696 [2022-03-15 19:49:12,230 INFO L226 Difference]: Without dead ends: 678 [2022-03-15 19:49:12,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 32 SyntacticMatches, 9 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=445, Invalid=3215, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 19:49:12,230 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 136 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:12,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 83 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:49:12,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2022-03-15 19:49:12,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 490. [2022-03-15 19:49:12,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 489 states have (on average 2.764826175869121) internal successors, (1352), 489 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:12,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1352 transitions. [2022-03-15 19:49:12,236 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1352 transitions. Word has length 23 [2022-03-15 19:49:12,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:12,236 INFO L470 AbstractCegarLoop]: Abstraction has 490 states and 1352 transitions. [2022-03-15 19:49:12,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:12,237 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1352 transitions. [2022-03-15 19:49:12,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:49:12,237 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:12,237 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:12,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Ended with exit code 0 [2022-03-15 19:49:12,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,84 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:12,438 INFO L402 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:12,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:12,438 INFO L85 PathProgramCache]: Analyzing trace with hash -472710794, now seen corresponding path program 69 times [2022-03-15 19:49:12,439 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:12,439 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819249519] [2022-03-15 19:49:12,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:12,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:13,306 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 19:49:13,307 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:13,307 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819249519] [2022-03-15 19:49:13,307 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819249519] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:13,307 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408926243] [2022-03-15 19:49:13,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:49:13,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:13,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:13,309 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:13,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2022-03-15 19:49:13,588 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:49:13,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:49:13,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 19:49:13,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:13,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:49:13,808 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-03-15 19:49:13,902 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:49:13,902 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 14 [2022-03-15 19:49:13,948 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:49:13,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:14,051 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3533 (Array Int Int))) (< (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3533) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse0 (+ .cse1 c_~q~0.offset 4)) (select .cse0 (+ .cse1 c_~q~0.offset)))) (+ c_~N~0 1))) (forall ((v_ArrVal_3533 (Array Int Int))) (<= c_~N~0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3533) c_~q~0.base)) (.cse3 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse2 (+ .cse3 c_~q~0.offset 4)) (select .cse2 (+ .cse3 c_~q~0.offset))))))) is different from false [2022-03-15 19:49:14,189 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:49:14,189 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 140 [2022-03-15 19:49:14,196 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:49:14,196 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 66 [2022-03-15 19:49:14,200 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:49:14,201 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 53 [2022-03-15 19:49:14,433 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:49:14,434 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408926243] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:14,434 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:14,434 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 32 [2022-03-15 19:49:14,434 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [22311938] [2022-03-15 19:49:14,434 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:14,436 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:14,441 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 47 transitions. [2022-03-15 19:49:14,441 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:15,327 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [118576#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 118578#(and (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0)))), 118577#(and (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)))] [2022-03-15 19:49:15,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:49:15,327 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:15,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:49:15,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1100, Unknown=1, NotChecked=68, Total=1332 [2022-03-15 19:49:15,328 INFO L87 Difference]: Start difference. First operand 490 states and 1352 transitions. Second operand has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 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 19:49:16,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:16,323 INFO L93 Difference]: Finished difference Result 539 states and 1471 transitions. [2022-03-15 19:49:16,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 19:49:16,323 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 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 23 [2022-03-15 19:49:16,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:16,324 INFO L225 Difference]: With dead ends: 539 [2022-03-15 19:49:16,324 INFO L226 Difference]: Without dead ends: 516 [2022-03-15 19:49:16,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=233, Invalid=1576, Unknown=1, NotChecked=82, Total=1892 [2022-03-15 19:49:16,324 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 60 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:16,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 60 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:49:16,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2022-03-15 19:49:16,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 489. [2022-03-15 19:49:16,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 488 states have (on average 2.7459016393442623) internal successors, (1340), 488 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:16,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 1340 transitions. [2022-03-15 19:49:16,330 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 1340 transitions. Word has length 23 [2022-03-15 19:49:16,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:16,330 INFO L470 AbstractCegarLoop]: Abstraction has 489 states and 1340 transitions. [2022-03-15 19:49:16,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 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 19:49:16,330 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 1340 transitions. [2022-03-15 19:49:16,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:49:16,331 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:16,331 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:16,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Ended with exit code 0 [2022-03-15 19:49:16,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,85 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:16,531 INFO L402 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:16,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:16,532 INFO L85 PathProgramCache]: Analyzing trace with hash 2001143936, now seen corresponding path program 70 times [2022-03-15 19:49:16,532 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:16,533 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131799975] [2022-03-15 19:49:16,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:16,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:17,547 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 19:49:17,547 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:17,547 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131799975] [2022-03-15 19:49:17,547 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131799975] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:17,547 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556870801] [2022-03-15 19:49:17,547 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:49:17,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:17,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:17,549 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:17,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2022-03-15 19:49:17,740 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:49:17,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:49:17,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-15 19:49:17,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:18,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:49:18,012 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-03-15 19:49:18,148 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:49:18,148 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 65 treesize of output 22 [2022-03-15 19:49:18,216 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:49:18,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:18,591 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:49:18,591 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 183 [2022-03-15 19:49:18,598 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:49:18,598 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 68 [2022-03-15 19:49:18,971 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:49:18,971 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556870801] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:18,971 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:18,971 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 9] total 35 [2022-03-15 19:49:18,972 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1122472365] [2022-03-15 19:49:18,972 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:18,973 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:18,980 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 41 transitions. [2022-03-15 19:49:18,980 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:19,815 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [120279#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 120280#(and (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)))), 120281#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 120282#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)) (or (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)))] [2022-03-15 19:49:19,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:49:19,815 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:19,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:49:19,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1439, Unknown=2, NotChecked=0, Total=1640 [2022-03-15 19:49:19,816 INFO L87 Difference]: Start difference. First operand 489 states and 1340 transitions. Second operand has 21 states, 20 states have (on average 1.8) internal successors, (36), 20 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 19:49:21,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:21,122 INFO L93 Difference]: Finished difference Result 558 states and 1494 transitions. [2022-03-15 19:49:21,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 19:49:21,123 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 20 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 23 [2022-03-15 19:49:21,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:21,124 INFO L225 Difference]: With dead ends: 558 [2022-03-15 19:49:21,124 INFO L226 Difference]: Without dead ends: 545 [2022-03-15 19:49:21,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=316, Invalid=2132, Unknown=2, NotChecked=0, Total=2450 [2022-03-15 19:49:21,124 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 76 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:21,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 61 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:49:21,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2022-03-15 19:49:21,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 489. [2022-03-15 19:49:21,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 488 states have (on average 2.737704918032787) internal successors, (1336), 488 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:21,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 1336 transitions. [2022-03-15 19:49:21,130 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 1336 transitions. Word has length 23 [2022-03-15 19:49:21,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:21,130 INFO L470 AbstractCegarLoop]: Abstraction has 489 states and 1336 transitions. [2022-03-15 19:49:21,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 20 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 19:49:21,130 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 1336 transitions. [2022-03-15 19:49:21,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:49:21,131 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:21,131 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:21,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Ended with exit code 0 [2022-03-15 19:49:21,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 86 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable87 [2022-03-15 19:49:21,332 INFO L402 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:21,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:21,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1256441438, now seen corresponding path program 71 times [2022-03-15 19:49:21,333 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:21,333 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959803925] [2022-03-15 19:49:21,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:21,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:22,501 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 19:49:22,501 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:22,501 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959803925] [2022-03-15 19:49:22,501 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959803925] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:22,501 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040303888] [2022-03-15 19:49:22,501 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:49:22,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:22,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:22,502 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:22,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2022-03-15 19:49:22,696 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:49:22,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:49:22,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 63 conjunts are in the unsatisfiable core [2022-03-15 19:49:22,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:22,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:49:22,979 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-03-15 19:49:23,080 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:49:23,080 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 12 [2022-03-15 19:49:23,177 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:49:23,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:23,479 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:49:23,479 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 140 [2022-03-15 19:49:23,485 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:49:23,485 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 66 [2022-03-15 19:49:23,492 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:49:23,492 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 53 [2022-03-15 19:49:23,709 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:49:23,709 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040303888] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:23,709 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:23,709 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 9] total 36 [2022-03-15 19:49:23,709 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1599831369] [2022-03-15 19:49:23,709 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:23,711 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:23,733 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 37 transitions. [2022-03-15 19:49:23,733 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:24,470 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [122008#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (< ~s~0 (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~N~0 ~s~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 122007#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 122009#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 122010#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1))))] [2022-03-15 19:49:24,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:49:24,470 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:24,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:49:24,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1518, Unknown=5, NotChecked=0, Total=1722 [2022-03-15 19:49:24,471 INFO L87 Difference]: Start difference. First operand 489 states and 1336 transitions. Second operand has 21 states, 20 states have (on average 1.7) internal successors, (34), 20 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 19:49:25,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:25,666 INFO L93 Difference]: Finished difference Result 570 states and 1519 transitions. [2022-03-15 19:49:25,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:49:25,667 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.7) internal successors, (34), 20 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 23 [2022-03-15 19:49:25,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:25,667 INFO L225 Difference]: With dead ends: 570 [2022-03-15 19:49:25,667 INFO L226 Difference]: Without dead ends: 561 [2022-03-15 19:49:25,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=286, Invalid=2259, Unknown=5, NotChecked=0, Total=2550 [2022-03-15 19:49:25,668 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 79 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:25,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 54 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:49:25,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2022-03-15 19:49:25,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 487. [2022-03-15 19:49:25,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 486 states have (on average 2.7386831275720165) internal successors, (1331), 486 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:25,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1331 transitions. [2022-03-15 19:49:25,676 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1331 transitions. Word has length 23 [2022-03-15 19:49:25,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:25,676 INFO L470 AbstractCegarLoop]: Abstraction has 487 states and 1331 transitions. [2022-03-15 19:49:25,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.7) internal successors, (34), 20 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 19:49:25,676 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1331 transitions. [2022-03-15 19:49:25,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:49:25,677 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:25,677 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:25,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Ended with exit code 0 [2022-03-15 19:49:25,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88,87 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:25,895 INFO L402 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:25,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:25,895 INFO L85 PathProgramCache]: Analyzing trace with hash 886855094, now seen corresponding path program 72 times [2022-03-15 19:49:25,896 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:25,896 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409844584] [2022-03-15 19:49:25,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:25,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:26,726 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 19:49:26,726 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:26,726 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409844584] [2022-03-15 19:49:26,726 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409844584] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:26,727 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121393440] [2022-03-15 19:49:26,727 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:49:26,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:26,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:26,728 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:26,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2022-03-15 19:49:26,956 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:49:26,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:49:26,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 19:49:26,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:27,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:49:27,098 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:49:27,249 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:49:27,250 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 14 [2022-03-15 19:49:27,312 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:49:27,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:27,507 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3674 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3674) c_~q~0.base))) (or (let ((.cse1 (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1)) (.cse0 (let ((.cse3 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse2 (+ .cse3 c_~q~0.offset 4)) (select .cse2 (+ .cse3 c_~q~0.offset)))))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (= (select .cse2 (+ c_~q~0.offset (* 4 c_~q_back~0))) 1))))) is different from false [2022-03-15 19:49:27,541 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:49:27,541 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 161 [2022-03-15 19:49:27,558 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:49:27,558 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 105 treesize of output 98 [2022-03-15 19:49:28,066 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:49:28,066 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121393440] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:28,066 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:28,066 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 32 [2022-03-15 19:49:28,066 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [279742216] [2022-03-15 19:49:28,066 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:28,068 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:28,074 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 43 transitions. [2022-03-15 19:49:28,074 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:29,135 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [123743#(and (or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 123741#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 123740#(and (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)))), 123742#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 123739#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))))] [2022-03-15 19:49:29,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:49:29,136 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:29,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:49:29,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1217, Unknown=1, NotChecked=72, Total=1482 [2022-03-15 19:49:29,136 INFO L87 Difference]: Start difference. First operand 487 states and 1331 transitions. Second operand has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:31,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:31,556 INFO L93 Difference]: Finished difference Result 645 states and 1637 transitions. [2022-03-15 19:49:31,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:49:31,556 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 states have internal predecessors, (38), 0 states have call successors, (0), 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 23 [2022-03-15 19:49:31,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:31,557 INFO L225 Difference]: With dead ends: 645 [2022-03-15 19:49:31,557 INFO L226 Difference]: Without dead ends: 619 [2022-03-15 19:49:31,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=333, Invalid=2322, Unknown=1, NotChecked=100, Total=2756 [2022-03-15 19:49:31,558 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 103 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:31,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 69 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:49:31,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-03-15 19:49:31,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 489. [2022-03-15 19:49:31,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 488 states have (on average 2.7336065573770494) internal successors, (1334), 488 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:31,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 1334 transitions. [2022-03-15 19:49:31,563 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 1334 transitions. Word has length 23 [2022-03-15 19:49:31,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:31,564 INFO L470 AbstractCegarLoop]: Abstraction has 489 states and 1334 transitions. [2022-03-15 19:49:31,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:31,564 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 1334 transitions. [2022-03-15 19:49:31,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:49:31,564 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:31,564 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:31,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Forceful destruction successful, exit code 0 [2022-03-15 19:49:31,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89,88 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:31,765 INFO L402 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:31,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:31,765 INFO L85 PathProgramCache]: Analyzing trace with hash 142152596, now seen corresponding path program 73 times [2022-03-15 19:49:31,766 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:31,766 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390675399] [2022-03-15 19:49:31,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:31,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:33,355 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 19:49:33,355 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:33,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390675399] [2022-03-15 19:49:33,355 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390675399] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:33,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5290676] [2022-03-15 19:49:33,356 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:49:33,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:33,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:33,359 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:33,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2022-03-15 19:49:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:33,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 61 conjunts are in the unsatisfiable core [2022-03-15 19:49:33,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:33,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:49:33,802 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:49:33,932 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:49:33,932 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 14 [2022-03-15 19:49:34,012 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:49:34,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:34,234 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3721 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3721) c_~q~0.base))) (or (not (= (select .cse0 (+ c_~q~0.offset (* 4 c_~q_back~0))) 1)) (let ((.cse2 (let ((.cse3 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse0 (+ .cse3 c_~q~0.offset 4)) (select .cse0 (+ .cse3 c_~q~0.offset))))) (.cse1 (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1))) (and (<= .cse1 .cse2) (<= .cse2 .cse1)))))) is different from false [2022-03-15 19:49:34,270 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:49:34,270 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 161 [2022-03-15 19:49:34,286 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:49:34,287 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 105 treesize of output 98 [2022-03-15 19:49:34,826 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:49:34,826 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5290676] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:34,826 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:34,826 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 9] total 36 [2022-03-15 19:49:34,826 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [976639270] [2022-03-15 19:49:34,826 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:34,828 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:34,834 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 39 transitions. [2022-03-15 19:49:34,834 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:35,827 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [125569#(and (or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 125567#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 125565#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 125568#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 125566#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))))] [2022-03-15 19:49:35,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:49:35,830 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:35,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:49:35,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1509, Unknown=1, NotChecked=80, Total=1806 [2022-03-15 19:49:35,831 INFO L87 Difference]: Start difference. First operand 489 states and 1334 transitions. Second operand has 22 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 21 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 19:49:39,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:39,104 INFO L93 Difference]: Finished difference Result 672 states and 1705 transitions. [2022-03-15 19:49:39,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 19:49:39,105 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 21 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 23 [2022-03-15 19:49:39,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:39,106 INFO L225 Difference]: With dead ends: 672 [2022-03-15 19:49:39,106 INFO L226 Difference]: Without dead ends: 654 [2022-03-15 19:49:39,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=466, Invalid=3197, Unknown=1, NotChecked=118, Total=3782 [2022-03-15 19:49:39,106 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 147 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:39,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 44 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:49:39,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2022-03-15 19:49:39,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 491. [2022-03-15 19:49:39,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 490 states have (on average 2.736734693877551) internal successors, (1341), 490 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:39,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 1341 transitions. [2022-03-15 19:49:39,113 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 1341 transitions. Word has length 23 [2022-03-15 19:49:39,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:39,113 INFO L470 AbstractCegarLoop]: Abstraction has 491 states and 1341 transitions. [2022-03-15 19:49:39,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 21 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 19:49:39,113 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 1341 transitions. [2022-03-15 19:49:39,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:49:39,114 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:39,114 INFO L514 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:39,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Forceful destruction successful, exit code 0 [2022-03-15 19:49:39,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,89 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:39,315 INFO L402 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:39,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:39,315 INFO L85 PathProgramCache]: Analyzing trace with hash 535265713, now seen corresponding path program 74 times [2022-03-15 19:49:39,316 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:39,316 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537425963] [2022-03-15 19:49:39,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:39,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:39,803 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:39,804 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:39,804 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537425963] [2022-03-15 19:49:39,804 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537425963] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:39,804 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970687376] [2022-03-15 19:49:39,804 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:49:39,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:39,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:39,805 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:39,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2022-03-15 19:49:40,005 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:49:40,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:49:40,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 19:49:40,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:40,157 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:49:40,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:40,189 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-03-15 19:49:40,190 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 25 treesize of output 16 [2022-03-15 19:49:40,240 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-03-15 19:49:40,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970687376] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:40,240 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:40,240 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 4] total 23 [2022-03-15 19:49:40,240 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1475385303] [2022-03-15 19:49:40,240 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:40,242 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:40,249 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 57 transitions. [2022-03-15 19:49:40,249 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:41,156 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [127419#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 127422#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0))), 127418#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 127423#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 1) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0)) (< 2 ~N~0)), 127420#(or (<= (+ 2 ~q_back~0) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (< ~q_back~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 127421#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))] [2022-03-15 19:49:41,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:49:41,156 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:41,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:49:41,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2022-03-15 19:49:41,157 INFO L87 Difference]: Start difference. First operand 491 states and 1341 transitions. Second operand has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:43,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:43,699 INFO L93 Difference]: Finished difference Result 809 states and 2043 transitions. [2022-03-15 19:49:43,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 19:49:43,700 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:49:43,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:43,701 INFO L225 Difference]: With dead ends: 809 [2022-03-15 19:49:43,701 INFO L226 Difference]: Without dead ends: 809 [2022-03-15 19:49:43,701 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=596, Invalid=2826, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 19:49:43,701 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 189 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:43,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 42 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:49:43,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-03-15 19:49:43,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 529. [2022-03-15 19:49:43,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 2.734848484848485) internal successors, (1444), 528 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:43,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1444 transitions. [2022-03-15 19:49:43,708 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1444 transitions. Word has length 23 [2022-03-15 19:49:43,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:43,708 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 1444 transitions. [2022-03-15 19:49:43,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:43,708 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1444 transitions. [2022-03-15 19:49:43,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:49:43,709 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:43,709 INFO L514 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:43,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Forceful destruction successful, exit code 0 [2022-03-15 19:49:43,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 90 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable91 [2022-03-15 19:49:43,910 INFO L402 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:43,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:43,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1975512933, now seen corresponding path program 75 times [2022-03-15 19:49:43,911 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:43,911 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685355757] [2022-03-15 19:49:43,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:43,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:44,588 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:44,588 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:44,589 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685355757] [2022-03-15 19:49:44,589 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685355757] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:44,589 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536782937] [2022-03-15 19:49:44,589 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:49:44,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:44,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:44,591 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:44,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2022-03-15 19:49:44,788 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:49:44,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:49:44,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 19:49:44,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:44,867 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:49:44,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:44,922 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-03-15 19:49:44,922 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 26 treesize of output 18 [2022-03-15 19:49:44,952 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:49:44,953 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536782937] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:44,953 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:44,953 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 19 [2022-03-15 19:49:44,953 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1316660387] [2022-03-15 19:49:44,953 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:44,955 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:44,962 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 64 transitions. [2022-03-15 19:49:44,962 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:45,771 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [129504#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)), 129501#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 129503#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)), 129502#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 129505#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (<= (+ 2 ~q_back~0) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< ~q_back~0 0) (<= ~n~0 (+ 2 ~q_back~0)))] [2022-03-15 19:49:45,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:49:45,772 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:45,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:49:45,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2022-03-15 19:49:45,772 INFO L87 Difference]: Start difference. First operand 529 states and 1444 transitions. Second operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:46,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:46,672 INFO L93 Difference]: Finished difference Result 767 states and 1995 transitions. [2022-03-15 19:49:46,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 19:49:46,672 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:49:46,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:46,673 INFO L225 Difference]: With dead ends: 767 [2022-03-15 19:49:46,673 INFO L226 Difference]: Without dead ends: 763 [2022-03-15 19:49:46,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=233, Invalid=1027, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:49:46,674 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 102 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:46,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 43 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:49:46,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2022-03-15 19:49:46,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 543. [2022-03-15 19:49:46,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 542 states have (on average 2.7472324723247232) internal successors, (1489), 542 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:46,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 1489 transitions. [2022-03-15 19:49:46,682 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 1489 transitions. Word has length 23 [2022-03-15 19:49:46,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:46,682 INFO L470 AbstractCegarLoop]: Abstraction has 543 states and 1489 transitions. [2022-03-15 19:49:46,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:46,682 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 1489 transitions. [2022-03-15 19:49:46,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:49:46,683 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:46,683 INFO L514 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:46,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Forceful destruction successful, exit code 0 [2022-03-15 19:49:46,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,91 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:46,887 INFO L402 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:46,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:46,888 INFO L85 PathProgramCache]: Analyzing trace with hash -971455989, now seen corresponding path program 76 times [2022-03-15 19:49:46,888 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:46,888 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49779832] [2022-03-15 19:49:46,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:46,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:47,472 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:47,472 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:47,472 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49779832] [2022-03-15 19:49:47,472 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49779832] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:47,472 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109461875] [2022-03-15 19:49:47,472 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:49:47,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:47,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:47,473 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:47,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2022-03-15 19:49:47,674 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:49:47,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:49:47,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 36 conjunts are in the unsatisfiable core [2022-03-15 19:49:47,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:47,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:49:47,879 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:49:47,926 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:49:47,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:47,993 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3872 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3872) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset 4)) 0))) is different from false [2022-03-15 19:49:48,006 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:49:48,006 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 47 treesize of output 47 [2022-03-15 19:49:48,008 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 25 treesize of output 18 [2022-03-15 19:49:48,126 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 2 not checked. [2022-03-15 19:49:48,126 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109461875] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:48,126 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:48,126 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 7] total 31 [2022-03-15 19:49:48,126 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2033648833] [2022-03-15 19:49:48,126 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:48,128 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:48,133 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 41 transitions. [2022-03-15 19:49:48,133 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:48,413 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [131546#(or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)), 131545#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))] [2022-03-15 19:49:48,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:49:48,414 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:48,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:49:48,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=918, Unknown=1, NotChecked=62, Total=1122 [2022-03-15 19:49:48,414 INFO L87 Difference]: Start difference. First operand 543 states and 1489 transitions. Second operand has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 16 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 19:49:48,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:48,960 INFO L93 Difference]: Finished difference Result 651 states and 1738 transitions. [2022-03-15 19:49:48,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 19:49:48,960 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 16 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 23 [2022-03-15 19:49:48,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:48,961 INFO L225 Difference]: With dead ends: 651 [2022-03-15 19:49:48,961 INFO L226 Difference]: Without dead ends: 651 [2022-03-15 19:49:48,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=191, Invalid=1372, Unknown=1, NotChecked=76, Total=1640 [2022-03-15 19:49:48,961 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 85 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:48,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 39 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:49:48,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2022-03-15 19:49:48,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 534. [2022-03-15 19:49:48,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 2.731707317073171) internal successors, (1456), 533 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:48,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 1456 transitions. [2022-03-15 19:49:48,969 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 1456 transitions. Word has length 23 [2022-03-15 19:49:48,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:48,969 INFO L470 AbstractCegarLoop]: Abstraction has 534 states and 1456 transitions. [2022-03-15 19:49:48,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 16 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 19:49:48,970 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 1456 transitions. [2022-03-15 19:49:48,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:49:48,971 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:48,971 INFO L514 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:48,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Forceful destruction successful, exit code 0 [2022-03-15 19:49:49,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,92 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:49,187 INFO L402 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:49,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:49,188 INFO L85 PathProgramCache]: Analyzing trace with hash -337464895, now seen corresponding path program 77 times [2022-03-15 19:49:49,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:49,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009657025] [2022-03-15 19:49:49,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:49,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:49,587 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:49:49,588 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:49,588 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009657025] [2022-03-15 19:49:49,588 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009657025] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:49,588 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176541898] [2022-03-15 19:49:49,588 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:49:49,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:49,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:49,589 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:49,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2022-03-15 19:49:49,797 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:49:49,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:49:49,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 36 conjunts are in the unsatisfiable core [2022-03-15 19:49:49,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:49,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:49:49,985 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:49:50,030 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:49:50,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:50,082 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3923 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3923) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset 4)) 0))) is different from false [2022-03-15 19:49:50,090 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:49:50,090 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 47 treesize of output 47 [2022-03-15 19:49:50,092 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 25 treesize of output 18 [2022-03-15 19:49:50,206 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:49:50,206 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176541898] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:50,206 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:50,207 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 7] total 29 [2022-03-15 19:49:50,207 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1980396778] [2022-03-15 19:49:50,207 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:50,208 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:50,214 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 35 transitions. [2022-03-15 19:49:50,214 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:50,450 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [133442#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 133443#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 133444#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))] [2022-03-15 19:49:50,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:49:50,450 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:50,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:49:50,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=859, Unknown=1, NotChecked=60, Total=1056 [2022-03-15 19:49:50,450 INFO L87 Difference]: Start difference. First operand 534 states and 1456 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:50,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:50,821 INFO L93 Difference]: Finished difference Result 682 states and 1797 transitions. [2022-03-15 19:49:50,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:49:50,821 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 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 23 [2022-03-15 19:49:50,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:50,822 INFO L225 Difference]: With dead ends: 682 [2022-03-15 19:49:50,822 INFO L226 Difference]: Without dead ends: 682 [2022-03-15 19:49:50,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=225, Invalid=1418, Unknown=1, NotChecked=78, Total=1722 [2022-03-15 19:49:50,822 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 79 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:50,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 26 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:49:50,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2022-03-15 19:49:50,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 547. [2022-03-15 19:49:50,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 546 states have (on average 2.7545787545787546) internal successors, (1504), 546 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:50,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1504 transitions. [2022-03-15 19:49:50,829 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1504 transitions. Word has length 23 [2022-03-15 19:49:50,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:50,829 INFO L470 AbstractCegarLoop]: Abstraction has 547 states and 1504 transitions. [2022-03-15 19:49:50,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:50,829 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1504 transitions. [2022-03-15 19:49:50,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:49:50,830 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:50,830 INFO L514 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:50,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Ended with exit code 0 [2022-03-15 19:49:51,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,93 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:51,031 INFO L402 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:51,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:51,031 INFO L85 PathProgramCache]: Analyzing trace with hash 518436405, now seen corresponding path program 78 times [2022-03-15 19:49:51,032 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:51,032 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381956032] [2022-03-15 19:49:51,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:51,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:51,735 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:51,735 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:51,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381956032] [2022-03-15 19:49:51,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381956032] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:51,736 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404838172] [2022-03-15 19:49:51,736 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:49:51,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:51,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:51,737 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:51,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2022-03-15 19:49:52,023 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:49:52,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:49:52,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 19:49:52,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:52,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:49:52,149 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:49:52,229 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:49:52,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:52,401 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:49:52,401 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 45 treesize of output 45 [2022-03-15 19:49:52,404 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 24 treesize of output 18 [2022-03-15 19:49:52,624 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:49:52,624 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404838172] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:52,624 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:52,625 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 26 [2022-03-15 19:49:52,625 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1853024383] [2022-03-15 19:49:52,625 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:52,627 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:52,633 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 31 transitions. [2022-03-15 19:49:52,633 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:54,122 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [135398#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= ~n~0 ~q_back~0) (< ~q_back~0 0)), 135400#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)), 135399#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))] [2022-03-15 19:49:54,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:49:54,122 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:54,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:49:54,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=717, Unknown=3, NotChecked=0, Total=870 [2022-03-15 19:49:54,123 INFO L87 Difference]: Start difference. First operand 547 states and 1504 transitions. Second operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:54,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:54,825 INFO L93 Difference]: Finished difference Result 604 states and 1625 transitions. [2022-03-15 19:49:54,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 19:49:54,825 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:49:54,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:54,826 INFO L225 Difference]: With dead ends: 604 [2022-03-15 19:49:54,826 INFO L226 Difference]: Without dead ends: 602 [2022-03-15 19:49:54,826 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=202, Invalid=1055, Unknown=3, NotChecked=0, Total=1260 [2022-03-15 19:49:54,826 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 64 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:54,826 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 43 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:49:54,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2022-03-15 19:49:54,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 542. [2022-03-15 19:49:54,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 2.7486136783733826) internal successors, (1487), 541 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:54,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1487 transitions. [2022-03-15 19:49:54,832 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1487 transitions. Word has length 23 [2022-03-15 19:49:54,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:54,832 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 1487 transitions. [2022-03-15 19:49:54,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:54,833 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1487 transitions. [2022-03-15 19:49:54,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:49:54,833 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:54,833 INFO L514 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:54,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Ended with exit code 0 [2022-03-15 19:49:55,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95,94 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:55,034 INFO L402 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:55,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:55,034 INFO L85 PathProgramCache]: Analyzing trace with hash -210245057, now seen corresponding path program 79 times [2022-03-15 19:49:55,035 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:55,035 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192334848] [2022-03-15 19:49:55,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:55,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:55,486 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:55,486 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:55,486 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192334848] [2022-03-15 19:49:55,486 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192334848] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:55,486 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691057956] [2022-03-15 19:49:55,486 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:49:55,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:55,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:55,487 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:55,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2022-03-15 19:49:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:55,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 19:49:55,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:55,835 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:49:55,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:55,866 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-03-15 19:49:55,866 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 25 treesize of output 16 [2022-03-15 19:49:55,914 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-03-15 19:49:55,914 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691057956] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:55,914 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:55,914 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 4] total 22 [2022-03-15 19:49:55,915 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [677909625] [2022-03-15 19:49:55,915 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:55,916 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:55,921 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 33 transitions. [2022-03-15 19:49:55,921 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:56,149 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [137258#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 137256#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= ~n~0 ~q_back~0) (< ~q_back~0 0)), 137257#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))), 137259#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0))] [2022-03-15 19:49:56,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:49:56,150 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:56,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:49:56,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=573, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:49:56,150 INFO L87 Difference]: Start difference. First operand 542 states and 1487 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 18 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 19:49:57,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:57,152 INFO L93 Difference]: Finished difference Result 665 states and 1817 transitions. [2022-03-15 19:49:57,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 19:49:57,152 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 18 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 23 [2022-03-15 19:49:57,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:57,153 INFO L225 Difference]: With dead ends: 665 [2022-03-15 19:49:57,153 INFO L226 Difference]: Without dead ends: 661 [2022-03-15 19:49:57,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=340, Invalid=1466, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 19:49:57,154 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 94 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:57,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 34 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:49:57,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2022-03-15 19:49:57,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 543. [2022-03-15 19:49:57,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 542 states have (on average 2.7675276752767526) internal successors, (1500), 542 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:57,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 1500 transitions. [2022-03-15 19:49:57,160 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 1500 transitions. Word has length 23 [2022-03-15 19:49:57,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:57,160 INFO L470 AbstractCegarLoop]: Abstraction has 543 states and 1500 transitions. [2022-03-15 19:49:57,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 18 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 19:49:57,160 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 1500 transitions. [2022-03-15 19:49:57,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:49:57,161 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:57,161 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:57,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Forceful destruction successful, exit code 0 [2022-03-15 19:49:57,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 95 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable96 [2022-03-15 19:49:57,362 INFO L402 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:57,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:57,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1548276494, now seen corresponding path program 80 times [2022-03-15 19:49:57,363 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:57,363 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108420755] [2022-03-15 19:49:57,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:57,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:57,434 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:49:57,434 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:57,434 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108420755] [2022-03-15 19:49:57,434 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108420755] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:57,434 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829010312] [2022-03-15 19:49:57,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:49:57,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:57,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:57,435 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:57,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2022-03-15 19:49:57,648 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:49:57,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:49:57,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:49:57,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:57,790 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:49:57,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:57,933 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:49:57,933 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829010312] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:57,933 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:57,933 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:49:57,934 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1644550656] [2022-03-15 19:49:57,934 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:57,936 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:57,948 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 68 transitions. [2022-03-15 19:49:57,948 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:57,962 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 12 treesize of output 4 [2022-03-15 19:49:58,005 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2022-03-15 19:49:58,066 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:49:58,109 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2022-03-15 19:49:58,139 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 12 treesize of output 4 [2022-03-15 19:49:58,172 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 12 treesize of output 4 [2022-03-15 19:49:58,208 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 12 treesize of output 4 [2022-03-15 19:49:58,236 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 12 treesize of output 4 [2022-03-15 19:49:58,266 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2022-03-15 19:49:58,302 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 12 treesize of output 4 [2022-03-15 19:49:58,371 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [139216#(or (<= ~n~0 (+ ~q_back~0 4)) (< ~q_back~0 0)), 139211#(or (<= ~q_back~0 0) (<= ~n~0 0)), 139215#(or (<= ~q_back~0 0) (<= ~n~0 (+ 3 ~q_back~0))), 139157#(or (not (<= 0 ~q_back~0)) (not (< ~q_back~0 ~n~0))), 139212#(or (<= ~n~0 (+ ~q_back~0 1)) (< ~q_back~0 0)), 139213#(or (< ~q_back~0 0) (<= ~n~0 (+ 2 ~q_back~0))), 139214#(or (<= ~n~0 (+ 3 ~q_back~0)) (< ~q_back~0 0))] [2022-03-15 19:49:58,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:49:58,372 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:58,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:49:58,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=975, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:49:58,372 INFO L87 Difference]: Start difference. First operand 543 states and 1500 transitions. Second operand has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:58,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:58,519 INFO L93 Difference]: Finished difference Result 586 states and 1434 transitions. [2022-03-15 19:49:58,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 19:49:58,519 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 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 19:49:58,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:58,520 INFO L225 Difference]: With dead ends: 586 [2022-03-15 19:49:58,520 INFO L226 Difference]: Without dead ends: 496 [2022-03-15 19:49:58,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=379, Invalid=1261, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 19:49:58,522 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 64 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:58,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 48 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:49:58,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-03-15 19:49:58,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 443. [2022-03-15 19:49:58,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 2.660633484162896) internal successors, (1176), 442 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:58,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1176 transitions. [2022-03-15 19:49:58,527 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 1176 transitions. Word has length 24 [2022-03-15 19:49:58,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:58,527 INFO L470 AbstractCegarLoop]: Abstraction has 443 states and 1176 transitions. [2022-03-15 19:49:58,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:58,527 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 1176 transitions. [2022-03-15 19:49:58,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:49:58,528 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:58,528 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:58,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Forceful destruction successful, exit code 0 [2022-03-15 19:49:58,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable97 [2022-03-15 19:49:58,729 INFO L402 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:58,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:58,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1521841559, now seen corresponding path program 81 times [2022-03-15 19:49:58,730 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:58,730 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878659750] [2022-03-15 19:49:58,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:58,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:59,486 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:59,486 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:59,486 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878659750] [2022-03-15 19:49:59,486 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878659750] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:59,486 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532658514] [2022-03-15 19:49:59,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:49:59,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:59,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:59,487 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:59,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2022-03-15 19:49:59,861 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 19:49:59,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:49:59,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 78 conjunts are in the unsatisfiable core [2022-03-15 19:49:59,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:50:00,613 INFO L353 Elim1Store]: treesize reduction 126, result has 25.4 percent of original size [2022-03-15 19:50:00,613 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 62 [2022-03-15 19:50:00,781 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:00,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:50:01,325 INFO L353 Elim1Store]: treesize reduction 131, result has 46.7 percent of original size [2022-03-15 19:50:01,325 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 106 treesize of output 146 [2022-03-15 19:50:02,325 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:02,325 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532658514] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:50:02,325 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:50:02,325 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 45 [2022-03-15 19:50:02,325 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1412839680] [2022-03-15 19:50:02,325 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:50:02,327 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:50:02,337 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 75 transitions. [2022-03-15 19:50:02,337 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:50:13,061 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [140887#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0)), 140884#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (= ~s~0 ~N~0)), 140891#(or (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (< (+ 3 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ 3 ~q_back~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 12)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 (+ 2 |thread1Thread1of1ForFork1_~i~0#1|)) (< ~q_front~0 0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0))), 140886#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0)), 140889#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_back~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0))), 140885#(or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0)), 140892#(or (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ 3 ~q_back~0)) (< 3 ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 12)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~N~0 2) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0))), 140888#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)), 140890#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (<= ~n~0 (+ 2 ~q_back~0)))] [2022-03-15 19:50:13,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 19:50:13,061 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:50:13,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 19:50:13,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=446, Invalid=2629, Unknown=5, NotChecked=0, Total=3080 [2022-03-15 19:50:13,061 INFO L87 Difference]: Start difference. First operand 443 states and 1176 transitions. Second operand has 27 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 26 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:18,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:50:18,409 INFO L93 Difference]: Finished difference Result 740 states and 1716 transitions. [2022-03-15 19:50:18,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 19:50:18,410 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 26 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:50:18,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:50:18,411 INFO L225 Difference]: With dead ends: 740 [2022-03-15 19:50:18,411 INFO L226 Difference]: Without dead ends: 727 [2022-03-15 19:50:18,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1319 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=1155, Invalid=5646, Unknown=5, NotChecked=0, Total=6806 [2022-03-15 19:50:18,412 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 218 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:50:18,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 74 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:50:18,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2022-03-15 19:50:18,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 454. [2022-03-15 19:50:18,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 2.6467991169977925) internal successors, (1199), 453 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:18,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1199 transitions. [2022-03-15 19:50:18,419 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 1199 transitions. Word has length 24 [2022-03-15 19:50:18,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:50:18,420 INFO L470 AbstractCegarLoop]: Abstraction has 454 states and 1199 transitions. [2022-03-15 19:50:18,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 26 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:18,420 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 1199 transitions. [2022-03-15 19:50:18,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:50:18,421 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:50:18,421 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:50:18,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Forceful destruction successful, exit code 0 [2022-03-15 19:50:18,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98,97 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:50:18,634 INFO L402 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:50:18,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:50:18,634 INFO L85 PathProgramCache]: Analyzing trace with hash 2028423239, now seen corresponding path program 82 times [2022-03-15 19:50:18,635 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:50:18,635 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090095799] [2022-03-15 19:50:18,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:50:18,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:50:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:50:19,244 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:19,244 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:50:19,244 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090095799] [2022-03-15 19:50:19,244 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090095799] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:50:19,244 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462847283] [2022-03-15 19:50:19,244 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:50:19,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:50:19,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:50:19,245 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:50:19,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2022-03-15 19:50:19,467 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:50:19,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:50:19,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 70 conjunts are in the unsatisfiable core [2022-03-15 19:50:19,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:50:20,049 INFO L353 Elim1Store]: treesize reduction 130, result has 23.1 percent of original size [2022-03-15 19:50:20,049 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 57 [2022-03-15 19:50:20,236 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:20,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:50:20,669 INFO L353 Elim1Store]: treesize reduction 130, result has 48.2 percent of original size [2022-03-15 19:50:20,670 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 152 [2022-03-15 19:50:21,524 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:21,525 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462847283] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:50:21,525 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:50:21,525 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 42 [2022-03-15 19:50:21,525 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2077059882] [2022-03-15 19:50:21,525 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:50:21,527 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:50:21,536 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 71 transitions. [2022-03-15 19:50:21,536 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:50:23,760 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [142781#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)), 142784#(or (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (< (+ 3 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ 3 ~q_back~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 12)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 (+ 2 |thread1Thread1of1ForFork1_~i~0#1|)) (< ~q_front~0 0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0))), 142779#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0)), 142785#(or (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ 3 ~q_back~0)) (< 3 ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 12)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~N~0 2) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0))), 142777#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (= ~s~0 ~N~0)), 142782#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_back~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0))), 142783#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (<= ~n~0 (+ 2 ~q_back~0))), 142780#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 (+ ~q_back~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0)), 142778#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (= ~s~0 ~N~0))] [2022-03-15 19:50:23,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:50:23,760 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:50:23,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:50:23,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=2303, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 19:50:23,761 INFO L87 Difference]: Start difference. First operand 454 states and 1199 transitions. Second operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:28,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:50:28,073 INFO L93 Difference]: Finished difference Result 716 states and 1671 transitions. [2022-03-15 19:50:28,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 19:50:28,074 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:50:28,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:50:28,075 INFO L225 Difference]: With dead ends: 716 [2022-03-15 19:50:28,075 INFO L226 Difference]: Without dead ends: 701 [2022-03-15 19:50:28,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 23 SyntacticMatches, 9 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1280 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1051, Invalid=5111, Unknown=0, NotChecked=0, Total=6162 [2022-03-15 19:50:28,075 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 235 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:50:28,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 90 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:50:28,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2022-03-15 19:50:28,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 448. [2022-03-15 19:50:28,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 2.6577181208053693) internal successors, (1188), 447 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:28,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 1188 transitions. [2022-03-15 19:50:28,083 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 1188 transitions. Word has length 24 [2022-03-15 19:50:28,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:50:28,083 INFO L470 AbstractCegarLoop]: Abstraction has 448 states and 1188 transitions. [2022-03-15 19:50:28,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:28,083 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 1188 transitions. [2022-03-15 19:50:28,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:50:28,084 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:50:28,084 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:50:28,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Forceful destruction successful, exit code 0 [2022-03-15 19:50:28,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99,98 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:50:28,285 INFO L402 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:50:28,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:50:28,285 INFO L85 PathProgramCache]: Analyzing trace with hash -435627299, now seen corresponding path program 83 times [2022-03-15 19:50:28,286 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:50:28,286 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400746474] [2022-03-15 19:50:28,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:50:28,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:50:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:50:28,815 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:28,815 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:50:28,816 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400746474] [2022-03-15 19:50:28,816 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400746474] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:50:28,816 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278259865] [2022-03-15 19:50:28,816 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:50:28,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:50:28,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:50:28,817 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:50:28,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2022-03-15 19:50:29,042 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:50:29,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:50:29,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 74 conjunts are in the unsatisfiable core [2022-03-15 19:50:29,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:50:29,582 INFO L353 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-03-15 19:50:29,583 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 74 treesize of output 20 [2022-03-15 19:50:29,671 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:29,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:50:30,027 INFO L353 Elim1Store]: treesize reduction 140, result has 46.4 percent of original size [2022-03-15 19:50:30,027 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 110 treesize of output 152 [2022-03-15 19:50:30,553 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:30,554 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278259865] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:50:30,554 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:50:30,554 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 42 [2022-03-15 19:50:30,554 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2075850415] [2022-03-15 19:50:30,554 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:50:30,556 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:50:30,565 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 79 transitions. [2022-03-15 19:50:30,565 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:50:32,691 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [144638#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (<= ~n~0 (+ 2 ~q_back~0))), 144639#(or (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (< (+ 3 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ 3 ~q_back~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 12)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 (+ 2 |thread1Thread1of1ForFork1_~i~0#1|)) (< ~q_front~0 0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0))), 144635#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)), 144637#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_back~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0))), 144632#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (= ~s~0 ~N~0)), 144633#(or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0)), 144634#(or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))), 144636#(or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)), 144640#(or (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ 3 ~q_back~0)) (< 3 ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 12)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~N~0 2) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)))] [2022-03-15 19:50:32,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:50:32,691 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:50:32,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:50:32,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=493, Invalid=2263, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 19:50:32,692 INFO L87 Difference]: Start difference. First operand 448 states and 1188 transitions. Second operand has 26 states, 25 states have (on average 2.36) internal successors, (59), 25 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 19:50:37,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:50:37,389 INFO L93 Difference]: Finished difference Result 632 states and 1530 transitions. [2022-03-15 19:50:37,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 19:50:37,389 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.36) internal successors, (59), 25 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 24 [2022-03-15 19:50:37,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:50:37,390 INFO L225 Difference]: With dead ends: 632 [2022-03-15 19:50:37,390 INFO L226 Difference]: Without dead ends: 615 [2022-03-15 19:50:37,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1212 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1123, Invalid=4883, Unknown=0, NotChecked=0, Total=6006 [2022-03-15 19:50:37,391 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 177 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:50:37,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 99 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:50:37,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-03-15 19:50:37,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 452. [2022-03-15 19:50:37,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 2.647450110864745) internal successors, (1194), 451 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:37,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1194 transitions. [2022-03-15 19:50:37,396 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1194 transitions. Word has length 24 [2022-03-15 19:50:37,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:50:37,397 INFO L470 AbstractCegarLoop]: Abstraction has 452 states and 1194 transitions. [2022-03-15 19:50:37,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.36) internal successors, (59), 25 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 19:50:37,397 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1194 transitions. [2022-03-15 19:50:37,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:50:37,397 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:50:37,397 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:50:37,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Ended with exit code 0 [2022-03-15 19:50:37,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 99 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2022-03-15 19:50:37,598 INFO L402 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:50:37,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:50:37,598 INFO L85 PathProgramCache]: Analyzing trace with hash -2046568257, now seen corresponding path program 84 times [2022-03-15 19:50:37,599 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:50:37,599 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179952379] [2022-03-15 19:50:37,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:50:37,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:50:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:50:38,174 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:38,174 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:50:38,174 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179952379] [2022-03-15 19:50:38,174 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179952379] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:50:38,174 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410052994] [2022-03-15 19:50:38,174 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:50:38,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:50:38,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:50:38,176 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:50:38,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2022-03-15 19:50:38,400 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:50:38,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:50:38,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 80 conjunts are in the unsatisfiable core [2022-03-15 19:50:38,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:50:39,228 INFO L353 Elim1Store]: treesize reduction 230, result has 8.4 percent of original size [2022-03-15 19:50:39,228 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 70 treesize of output 40 [2022-03-15 19:50:39,361 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:39,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:50:40,021 INFO L353 Elim1Store]: treesize reduction 143, result has 41.9 percent of original size [2022-03-15 19:50:40,021 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 106 treesize of output 134 [2022-03-15 19:50:40,983 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:40,984 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410052994] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:50:40,984 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:50:40,984 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 44 [2022-03-15 19:50:40,984 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1145223065] [2022-03-15 19:50:40,984 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:50:40,986 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:50:40,996 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 75 transitions. [2022-03-15 19:50:40,996 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:50:51,829 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [146419#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (<= (+ ~q_back~0 1) ~q_front~0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ 3 ~q_back~0)) (< 3 ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 12)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~N~0 2)) (or (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ 3 ~q_back~0)) (< 3 ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 12)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~N~0 2))), 146418#(and (or (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (< (+ 3 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ 3 ~q_back~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 12)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 (+ 2 |thread1Thread1of1ForFork1_~i~0#1|)) (< ~q_front~0 0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (<= (+ ~q_back~0 1) ~q_front~0) (< (+ 3 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ 3 ~q_back~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 12)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 (+ 2 |thread1Thread1of1ForFork1_~i~0#1|)) (< ~q_front~0 0))), 146414#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)))), 146416#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_back~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_back~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 146417#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0)))), 146413#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 146415#(and (or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 146412#(and (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0))), 146411#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))))] [2022-03-15 19:50:51,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:50:51,829 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:50:51,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:50:51,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=2498, Unknown=5, NotChecked=0, Total=2970 [2022-03-15 19:50:51,830 INFO L87 Difference]: Start difference. First operand 452 states and 1194 transitions. Second operand has 26 states, 25 states have (on average 2.28) internal successors, (57), 25 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:00,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:51:00,148 INFO L93 Difference]: Finished difference Result 622 states and 1512 transitions. [2022-03-15 19:51:00,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 19:51:00,149 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.28) internal successors, (57), 25 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:51:00,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:51:00,150 INFO L225 Difference]: With dead ends: 622 [2022-03-15 19:51:00,150 INFO L226 Difference]: Without dead ends: 609 [2022-03-15 19:51:00,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 23 SyntacticMatches, 9 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1450 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=988, Invalid=5013, Unknown=5, NotChecked=0, Total=6006 [2022-03-15 19:51:00,150 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 179 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:51:00,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 96 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:51:00,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2022-03-15 19:51:00,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 454. [2022-03-15 19:51:00,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 2.642384105960265) internal successors, (1197), 453 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:00,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1197 transitions. [2022-03-15 19:51:00,156 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 1197 transitions. Word has length 24 [2022-03-15 19:51:00,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:51:00,156 INFO L470 AbstractCegarLoop]: Abstraction has 454 states and 1197 transitions. [2022-03-15 19:51:00,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.28) internal successors, (57), 25 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:00,156 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 1197 transitions. [2022-03-15 19:51:00,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:51:00,157 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:51:00,157 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:51:00,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Ended with exit code 0 [2022-03-15 19:51:00,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101,100 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:00,357 INFO L402 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:51:00,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:51:00,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1503696541, now seen corresponding path program 85 times [2022-03-15 19:51:00,359 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:51:00,359 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143275921] [2022-03-15 19:51:00,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:51:00,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:51:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:51:00,999 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:51:00,999 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:51:00,999 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143275921] [2022-03-15 19:51:00,999 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143275921] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:51:00,999 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798043985] [2022-03-15 19:51:00,999 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:51:01,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:01,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:51:01,000 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:51:01,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2022-03-15 19:51:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:51:01,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-15 19:51:01,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:51:01,532 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-03-15 19:51:01,533 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 72 treesize of output 20 [2022-03-15 19:51:01,633 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:51:01,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:51:01,987 INFO L353 Elim1Store]: treesize reduction 140, result has 46.4 percent of original size [2022-03-15 19:51:01,987 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 110 treesize of output 152 [2022-03-15 19:51:02,227 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:51:02,227 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798043985] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:51:02,227 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:51:02,227 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 9] total 34 [2022-03-15 19:51:02,227 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1074944595] [2022-03-15 19:51:02,228 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:51:02,229 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:51:02,239 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 71 transitions. [2022-03-15 19:51:02,239 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:51:05,855 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [148178#(and (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))))) (<= (+ 2 ~q_back~0) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ 3 ~q_back~0)) (< 3 ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 12)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~N~0 2)) (or (<= (+ 2 ~q_back~0) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 1)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4)))) (+ ~N~0 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ 3 ~q_back~0)) (< 3 ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 12)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~N~0 2))), 148173#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)) (or (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 148177#(and (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))))) (<= (+ 2 ~q_back~0) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (< (+ 3 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ 3 ~q_back~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 12)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 (+ 2 |thread1Thread1of1ForFork1_~i~0#1|)) (< ~q_front~0 0)) (or (<= (+ 2 ~q_back~0) ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 1)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4)))) (+ ~N~0 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (< (+ 3 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ 3 ~q_back~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 12)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 (+ 2 |thread1Thread1of1ForFork1_~i~0#1|)) (< ~q_front~0 0))), 148172#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 148175#(and (or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4)))) (+ ~N~0 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))))) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 148170#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 148171#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 148176#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4)))) (+ ~N~0 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0))) (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))))) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0)))), 148174#(and (or (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ ~q_back~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)))] [2022-03-15 19:51:05,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 19:51:05,855 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:51:05,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 19:51:05,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1721, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:51:05,856 INFO L87 Difference]: Start difference. First operand 454 states and 1197 transitions. Second operand has 27 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 26 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:11,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:51:11,003 INFO L93 Difference]: Finished difference Result 731 states and 1698 transitions. [2022-03-15 19:51:11,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 19:51:11,004 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 26 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:51:11,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:51:11,005 INFO L225 Difference]: With dead ends: 731 [2022-03-15 19:51:11,005 INFO L226 Difference]: Without dead ends: 714 [2022-03-15 19:51:11,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 30 SyntacticMatches, 11 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=781, Invalid=4049, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 19:51:11,005 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 232 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:51:11,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 89 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:51:11,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2022-03-15 19:51:11,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 448. [2022-03-15 19:51:11,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 2.6532438478747205) internal successors, (1186), 447 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:11,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 1186 transitions. [2022-03-15 19:51:11,011 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 1186 transitions. Word has length 24 [2022-03-15 19:51:11,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:51:11,011 INFO L470 AbstractCegarLoop]: Abstraction has 448 states and 1186 transitions. [2022-03-15 19:51:11,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 26 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:11,011 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 1186 transitions. [2022-03-15 19:51:11,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:51:11,012 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:51:11,012 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:51:11,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Ended with exit code 0 [2022-03-15 19:51:11,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 101 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2022-03-15 19:51:11,212 INFO L402 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:51:11,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:51:11,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1122723607, now seen corresponding path program 86 times [2022-03-15 19:51:11,214 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:51:11,214 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487788293] [2022-03-15 19:51:11,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:51:11,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:51:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:51:11,896 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:51:11,897 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:51:11,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487788293] [2022-03-15 19:51:11,897 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487788293] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:51:11,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025784592] [2022-03-15 19:51:11,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:51:11,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:11,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:51:11,898 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:51:11,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2022-03-15 19:51:12,120 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:51:12,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:51:12,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 80 conjunts are in the unsatisfiable core [2022-03-15 19:51:12,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:51:12,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:51:12,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:51:12,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:51:12,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:51:12,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:51:12,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:51:12,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:51:12,843 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:51:12,844 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 58 [2022-03-15 19:51:13,036 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:51:13,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:51:14,090 INFO L353 Elim1Store]: treesize reduction 131, result has 46.7 percent of original size [2022-03-15 19:51:14,090 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 116 treesize of output 149 [2022-03-15 19:51:15,158 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:51:15,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025784592] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:51:15,158 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:51:15,158 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 44 [2022-03-15 19:51:15,159 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [443779437] [2022-03-15 19:51:15,159 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:51:15,160 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:51:15,172 INFO L252 McrAutomatonBuilder]: Finished intersection with 61 states and 101 transitions. [2022-03-15 19:51:15,172 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:51:49,242 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [150040#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 150044#(and (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))))) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4)))) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0)))), 150045#(and (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))))) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_back~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4)))) (+ ~N~0 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_back~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 150043#(and (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))))) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ 3 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~q_back~0 (+ 3 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (< ~q_front~0 0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (<= ~n~0 (+ 3 ~q_front~0)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4)))) (+ ~N~0 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~q_back~0 (+ 3 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (< ~q_front~0 0))), 150041#(and (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)))), 150042#(and (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0)))), 150048#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 1)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4)))) (+ ~N~0 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ 3 ~q_back~0)) (< 3 ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 12)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~N~0 2)) (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))))) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ 3 ~q_back~0)) (< 3 ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 12)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~N~0 2))), 150047#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 1)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4)))) (+ ~N~0 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (< (+ 3 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ 3 ~q_back~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 12)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 (+ 2 |thread1Thread1of1ForFork1_~i~0#1|)) (< ~q_front~0 0)) (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))))) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (< (+ 3 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ 3 ~q_back~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 12)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 (+ 2 |thread1Thread1of1ForFork1_~i~0#1|)) (< ~q_front~0 0))), 150046#(and (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))))) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4)))) (+ ~N~0 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0))))] [2022-03-15 19:51:49,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:51:49,242 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:51:49,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:51:49,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=2514, Unknown=17, NotChecked=0, Total=2970 [2022-03-15 19:51:49,242 INFO L87 Difference]: Start difference. First operand 448 states and 1186 transitions. Second operand has 26 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:59,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:51:59,447 INFO L93 Difference]: Finished difference Result 626 states and 1518 transitions. [2022-03-15 19:51:59,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 19:51:59,448 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 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 19:51:59,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:51:59,449 INFO L225 Difference]: With dead ends: 626 [2022-03-15 19:51:59,449 INFO L226 Difference]: Without dead ends: 621 [2022-03-15 19:51:59,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 34 SyntacticMatches, 11 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2065 ImplicationChecksByTransitivity, 40.6s TimeCoverageRelationStatistics Valid=899, Invalid=5726, Unknown=17, NotChecked=0, Total=6642 [2022-03-15 19:51:59,449 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 135 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:51:59,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 93 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 19:51:59,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2022-03-15 19:51:59,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 462. [2022-03-15 19:51:59,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 461 states have (on average 2.631236442516269) internal successors, (1213), 461 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:59,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1213 transitions. [2022-03-15 19:51:59,457 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 1213 transitions. Word has length 24 [2022-03-15 19:51:59,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:51:59,457 INFO L470 AbstractCegarLoop]: Abstraction has 462 states and 1213 transitions. [2022-03-15 19:51:59,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:59,457 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 1213 transitions. [2022-03-15 19:51:59,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:51:59,458 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:51:59,458 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:51:59,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Forceful destruction successful, exit code 0 [2022-03-15 19:51:59,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 102 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2022-03-15 19:51:59,673 INFO L402 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:51:59,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:51:59,673 INFO L85 PathProgramCache]: Analyzing trace with hash 477714247, now seen corresponding path program 87 times [2022-03-15 19:51:59,674 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:51:59,674 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634587629] [2022-03-15 19:51:59,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:51:59,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:51:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:52:00,552 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:00,552 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:52:00,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634587629] [2022-03-15 19:52:00,553 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634587629] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:52:00,553 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991901455] [2022-03-15 19:52:00,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:52:00,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:00,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:52:00,554 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:52:00,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2022-03-15 19:52:00,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:52:00,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:52:00,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 85 conjunts are in the unsatisfiable core [2022-03-15 19:52:00,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:52:01,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:52:01,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:52:01,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:52:01,492 INFO L353 Elim1Store]: treesize reduction 37, result has 24.5 percent of original size [2022-03-15 19:52:01,493 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 32 [2022-03-15 19:52:01,640 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:01,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:52:02,211 INFO L353 Elim1Store]: treesize reduction 161, result has 37.1 percent of original size [2022-03-15 19:52:02,211 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 109 treesize of output 126 [2022-03-15 19:52:03,043 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:03,043 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991901455] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:52:03,043 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:52:03,043 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 45 [2022-03-15 19:52:03,043 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [271564539] [2022-03-15 19:52:03,044 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:52:03,046 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:52:03,059 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 86 transitions. [2022-03-15 19:52:03,059 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:52:07,442 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [151842#(and (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))))) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4)))) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0)))), 151843#(and (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))))) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_back~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4)))) (+ ~N~0 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_back~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 151846#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 1)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4)))) (+ ~N~0 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ 3 ~q_back~0)) (< 3 ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 12)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~N~0 2)) (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))))) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ 3 ~q_back~0)) (< 3 ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 12)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~N~0 2))), 151840#(and (or (<= ~n~0 (+ 2 ~q_front~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (<= ~n~0 (+ 2 ~q_front~0)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0)))), 151838#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 151844#(and (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))))) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4)))) (+ ~N~0 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0)))), 151841#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)) (or (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 151845#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 1)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4)))) (+ ~N~0 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (< (+ 3 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ 3 ~q_back~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 12)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 (+ 2 |thread1Thread1of1ForFork1_~i~0#1|)) (< ~q_front~0 0)) (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0 (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))))) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (< (+ 3 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ 3 ~q_back~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 12)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 (+ 2 |thread1Thread1of1ForFork1_~i~0#1|)) (< ~q_front~0 0))), 151839#(and (or (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0)) (or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1))))] [2022-03-15 19:52:07,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 19:52:07,442 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:52:07,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 19:52:07,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=449, Invalid=2631, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 19:52:07,443 INFO L87 Difference]: Start difference. First operand 462 states and 1213 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 26 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:17,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:52:17,259 INFO L93 Difference]: Finished difference Result 653 states and 1546 transitions. [2022-03-15 19:52:17,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 19:52:17,259 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 26 states have internal predecessors, (61), 0 states have call successors, (0), 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 19:52:17,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:52:17,260 INFO L225 Difference]: With dead ends: 653 [2022-03-15 19:52:17,260 INFO L226 Difference]: Without dead ends: 636 [2022-03-15 19:52:17,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 26 SyntacticMatches, 10 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1644 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=1027, Invalid=5779, Unknown=0, NotChecked=0, Total=6806 [2022-03-15 19:52:17,261 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 191 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:52:17,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 89 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:52:17,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2022-03-15 19:52:17,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 464. [2022-03-15 19:52:17,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 2.626349892008639) internal successors, (1216), 463 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:17,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1216 transitions. [2022-03-15 19:52:17,268 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1216 transitions. Word has length 24 [2022-03-15 19:52:17,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:52:17,268 INFO L470 AbstractCegarLoop]: Abstraction has 464 states and 1216 transitions. [2022-03-15 19:52:17,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 26 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:17,268 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1216 transitions. [2022-03-15 19:52:17,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:52:17,268 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:52:17,269 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:52:17,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Forceful destruction successful, exit code 0 [2022-03-15 19:52:17,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 103 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable104 [2022-03-15 19:52:17,469 INFO L402 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:52:17,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:52:17,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1133226711, now seen corresponding path program 88 times [2022-03-15 19:52:17,470 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:52:17,470 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520369699] [2022-03-15 19:52:17,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:52:17,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:52:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:52:18,088 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:18,088 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:52:18,088 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520369699] [2022-03-15 19:52:18,088 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520369699] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:52:18,088 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333264344] [2022-03-15 19:52:18,088 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:52:18,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:18,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:52:18,089 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:52:18,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2022-03-15 19:52:18,320 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:52:18,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:52:18,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 72 conjunts are in the unsatisfiable core [2022-03-15 19:52:18,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:52:19,071 INFO L353 Elim1Store]: treesize reduction 162, result has 4.1 percent of original size [2022-03-15 19:52:19,072 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 100 treesize of output 37 [2022-03-15 19:52:19,157 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:19,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:52:19,634 INFO L353 Elim1Store]: treesize reduction 130, result has 48.2 percent of original size [2022-03-15 19:52:19,634 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 131 treesize of output 158 [2022-03-15 19:52:20,512 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:20,512 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333264344] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:52:20,513 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:52:20,513 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 42 [2022-03-15 19:52:20,513 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1980118810] [2022-03-15 19:52:20,513 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:52:20,514 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:52:20,525 INFO L252 McrAutomatonBuilder]: Finished intersection with 52 states and 82 transitions. [2022-03-15 19:52:20,525 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:52:23,269 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [153664#(or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)) (= ~s~0 ~N~0)), 153671#(or (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (< (+ 3 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ 3 ~q_back~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 12)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 (+ 2 |thread1Thread1of1ForFork1_~i~0#1|)) (< ~q_front~0 0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0))), 153669#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_back~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0))), 153672#(or (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ 3 ~q_back~0)) (< 3 ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 12)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~N~0 2) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0))), 153665#(or (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_front~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (< ~q_front~0 0) (= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0)), 153666#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (= (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) ~N~0)), 153670#(or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (<= ~n~0 (+ 2 ~q_back~0))), 153667#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)), 153668#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (<= ~q_back~0 (+ 2 ~q_front~0)))] [2022-03-15 19:52:23,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:52:23,269 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:52:23,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:52:23,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=2292, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 19:52:23,270 INFO L87 Difference]: Start difference. First operand 464 states and 1216 transitions. Second operand has 26 states, 25 states have (on average 2.4) internal successors, (60), 25 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 19:52:27,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:52:27,281 INFO L93 Difference]: Finished difference Result 585 states and 1437 transitions. [2022-03-15 19:52:27,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 19:52:27,282 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.4) internal successors, (60), 25 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 24 [2022-03-15 19:52:27,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:52:27,283 INFO L225 Difference]: With dead ends: 585 [2022-03-15 19:52:27,283 INFO L226 Difference]: Without dead ends: 572 [2022-03-15 19:52:27,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 26 SyntacticMatches, 11 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=899, Invalid=4213, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 19:52:27,284 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 165 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:52:27,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 109 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:52:27,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2022-03-15 19:52:27,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 466. [2022-03-15 19:52:27,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 465 states have (on average 2.621505376344086) internal successors, (1219), 465 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:27,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 1219 transitions. [2022-03-15 19:52:27,291 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 1219 transitions. Word has length 24 [2022-03-15 19:52:27,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:52:27,291 INFO L470 AbstractCegarLoop]: Abstraction has 466 states and 1219 transitions. [2022-03-15 19:52:27,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.4) internal successors, (60), 25 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 19:52:27,291 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 1219 transitions. [2022-03-15 19:52:27,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:52:27,292 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:52:27,292 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:52:27,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Forceful destruction successful, exit code 0 [2022-03-15 19:52:27,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105,104 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:27,507 INFO L402 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:52:27,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:52:27,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1877929209, now seen corresponding path program 89 times [2022-03-15 19:52:27,508 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:52:27,508 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816954962] [2022-03-15 19:52:27,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:52:27,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:52:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:52:28,287 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:28,287 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:52:28,287 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816954962] [2022-03-15 19:52:28,287 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816954962] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:52:28,287 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467888330] [2022-03-15 19:52:28,287 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:52:28,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:28,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:52:28,288 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:52:28,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2022-03-15 19:52:28,539 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:52:28,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:52:28,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 66 conjunts are in the unsatisfiable core [2022-03-15 19:52:28,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:52:28,870 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-03-15 19:52:28,870 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 68 treesize of output 16 [2022-03-15 19:52:28,975 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:52:28,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:52:29,360 INFO L353 Elim1Store]: treesize reduction 140, result has 46.4 percent of original size [2022-03-15 19:52:29,361 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 122 treesize of output 155 [2022-03-15 19:52:29,606 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:52:29,607 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467888330] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:52:29,607 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:52:29,607 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 9] total 34 [2022-03-15 19:52:29,607 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1909789734] [2022-03-15 19:52:29,607 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:52:29,609 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:52:29,618 INFO L252 McrAutomatonBuilder]: Finished intersection with 50 states and 78 transitions. [2022-03-15 19:52:29,618 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:52:33,425 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [155405#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0)) (<= ~q_back~0 (+ ~q_front~0 1)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)))), 155408#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0))) (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 0)) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (<= ~N~0 (+ |thread1Thread1of1ForFork1_~i~0#1| 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (< (+ 2 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~n~0 (+ 2 ~q_back~0)))), 155402#(and (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (< ~s~0 (+ ~N~0 1)) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (<= ~n~0 ~q_front~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 ~s~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0)))), 155406#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0))) (or (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (<= ~q_back~0 (+ 2 ~q_front~0)))), 155407#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_back~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 |thread1Thread1of1ForFork1_~i~0#1|) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ ~q_back~0 1)) (<= ~q_back~0 (+ ~q_front~0 1)) (< ~q_front~0 0) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 155409#(and (or (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (< (+ 3 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ 3 ~q_back~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 12)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 (+ 2 |thread1Thread1of1ForFork1_~i~0#1|)) (< ~q_front~0 0)) (or (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (<= (+ ~q_back~0 1) ~q_front~0) (< (+ 3 |thread1Thread1of1ForFork1_~i~0#1|) ~N~0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ 3 ~q_back~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 12)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (<= ~N~0 (+ 2 |thread1Thread1of1ForFork1_~i~0#1|)) (< ~q_front~0 0))), 155410#(and (or (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0)) (<= (+ ~q_back~0 1) ~q_front~0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ 3 ~q_back~0)) (< 3 ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 12)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~N~0 2)) (or (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 12 (* ~q_front~0 4))) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 8)) 1)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0) (<= (+ ~q_back~0 1) ~q_front~0) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 8 (* ~q_front~0 4))) 0) (<= ~n~0 (+ 3 ~q_back~0)) (< 3 ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 12)) 0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset 4)) 1)) (< ~q_front~0 0) (<= ~N~0 2))), 155404#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (< (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= ~q_back~0 ~q_front~0) (<= ~N~0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) ~s~0)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset 4 (* ~q_front~0 4))) 0)) (<= ~n~0 ~q_back~0) (< ~q_front~0 0))), 155403#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (< ~s~0 (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q~0.base) (+ (* ~q_back~0 4) ~q~0.offset)) 0)) (<= (+ ~q_back~0 1) ~q_front~0) (<= ~N~0 ~s~0) (<= ~n~0 ~q_back~0) (< ~q_front~0 0) (not (= (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 0))))] [2022-03-15 19:52:33,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 19:52:33,425 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:52:33,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 19:52:33,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1752, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:52:33,425 INFO L87 Difference]: Start difference. First operand 466 states and 1219 transitions. Second operand has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:43,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:52:43,159 INFO L93 Difference]: Finished difference Result 680 states and 1577 transitions. [2022-03-15 19:52:43,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 19:52:43,160 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:52:43,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:52:43,161 INFO L225 Difference]: With dead ends: 680 [2022-03-15 19:52:43,161 INFO L226 Difference]: Without dead ends: 665 [2022-03-15 19:52:43,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 32 SyntacticMatches, 11 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=901, Invalid=4799, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 19:52:43,161 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 233 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:52:43,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 84 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:52:43,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2022-03-15 19:52:43,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 466. [2022-03-15 19:52:43,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 465 states have (on average 2.621505376344086) internal successors, (1219), 465 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:43,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 1219 transitions. [2022-03-15 19:52:43,169 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 1219 transitions. Word has length 24 [2022-03-15 19:52:43,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:52:43,169 INFO L470 AbstractCegarLoop]: Abstraction has 466 states and 1219 transitions. [2022-03-15 19:52:43,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:43,169 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 1219 transitions. [2022-03-15 19:52:43,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:52:43,170 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:52:43,170 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:52:43,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Ended with exit code 0 [2022-03-15 19:52:43,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106,105 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:43,379 INFO L402 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:52:43,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:52:43,380 INFO L85 PathProgramCache]: Analyzing trace with hash 38186039, now seen corresponding path program 90 times [2022-03-15 19:52:43,380 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:52:43,380 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196362521] [2022-03-15 19:52:43,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:52:43,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:52:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:52:44,068 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:44,069 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:52:44,069 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196362521] [2022-03-15 19:52:44,069 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196362521] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:52:44,069 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838489164] [2022-03-15 19:52:44,069 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:52:44,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:44,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:52:44,070 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:52:44,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Waiting until timeout for monitored process [2022-03-15 19:52:44,390 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:52:44,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:52:44,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 91 conjunts are in the unsatisfiable core [2022-03-15 19:52:44,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:52:44,443 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 15 treesize of output 11 [2022-03-15 19:52:44,487 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 15 treesize of output 11 [2022-03-15 19:52:44,528 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 15 treesize of output 11 [2022-03-15 19:52:44,572 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 15 treesize of output 11 [2022-03-15 19:52:44,616 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:52:45,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:52:45,029 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 40 treesize of output 38 [2022-03-15 19:52:45,495 INFO L353 Elim1Store]: treesize reduction 124, result has 23.0 percent of original size [2022-03-15 19:52:45,495 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 68 treesize of output 56 [2022-03-15 19:52:45,687 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:45,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:52:51,592 INFO L353 Elim1Store]: treesize reduction 216, result has 31.6 percent of original size [2022-03-15 19:52:51,592 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 4 case distinctions, treesize of input 442 treesize of output 244 [2022-03-15 19:52:52,182 INFO L353 Elim1Store]: treesize reduction 252, result has 65.0 percent of original size [2022-03-15 19:52:52,183 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 615 treesize of output 955 [2022-03-15 19:52:52,331 INFO L353 Elim1Store]: treesize reduction 132, result has 45.2 percent of original size [2022-03-15 19:52:52,332 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 955 treesize of output 991 [2022-03-15 19:52:52,424 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-03-15 19:52:52,424 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 293 treesize of output 221 [2022-03-15 19:52:52,487 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-03-15 19:52:52,487 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 221 treesize of output 185 Received shutdown request... [2022-03-15 19:55:39,304 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-03-15 19:55:39,306 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-03-15 19:55:39,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Ended with exit code 0 [2022-03-15 19:55:39,324 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:55:39,324 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:55:39,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 106 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable107 [2022-03-15 19:55:39,506 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 25 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 14ms.. [2022-03-15 19:55:39,508 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-03-15 19:55:39,508 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-03-15 19:55:39,510 INFO L732 BasicCegarLoop]: Path program histogram: [90, 14, 2, 1, 1] [2022-03-15 19:55:39,511 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 19:55:39,511 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 19:55:39,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 07:55:39 BasicIcfg [2022-03-15 19:55:39,513 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 19:55:39,513 INFO L158 Benchmark]: Toolchain (without parser) took 734813.35ms. Allocated memory was 179.3MB in the beginning and 595.6MB in the end (delta: 416.3MB). Free memory was 123.2MB in the beginning and 326.1MB in the end (delta: -203.0MB). Peak memory consumption was 366.4MB. Max. memory is 8.0GB. [2022-03-15 19:55:39,513 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 179.3MB. Free memory is still 140.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 19:55:39,513 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.38ms. Allocated memory was 179.3MB in the beginning and 238.0MB in the end (delta: 58.7MB). Free memory was 123.0MB in the beginning and 207.5MB in the end (delta: -84.5MB). Peak memory consumption was 6.9MB. Max. memory is 8.0GB. [2022-03-15 19:55:39,513 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.63ms. Allocated memory is still 238.0MB. Free memory was 207.5MB in the beginning and 205.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 19:55:39,513 INFO L158 Benchmark]: Boogie Preprocessor took 44.85ms. Allocated memory is still 238.0MB. Free memory was 205.9MB in the beginning and 204.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:55:39,513 INFO L158 Benchmark]: RCFGBuilder took 579.43ms. Allocated memory is still 238.0MB. Free memory was 204.4MB in the beginning and 182.9MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-03-15 19:55:39,513 INFO L158 Benchmark]: TraceAbstraction took 733797.68ms. Allocated memory was 238.0MB in the beginning and 595.6MB in the end (delta: 357.6MB). Free memory was 182.3MB in the beginning and 326.1MB in the end (delta: -143.8MB). Peak memory consumption was 366.3MB. Max. memory is 8.0GB. [2022-03-15 19:55:39,513 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 179.3MB. Free memory is still 140.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 332.38ms. Allocated memory was 179.3MB in the beginning and 238.0MB in the end (delta: 58.7MB). Free memory was 123.0MB in the beginning and 207.5MB in the end (delta: -84.5MB). Peak memory consumption was 6.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.63ms. Allocated memory is still 238.0MB. Free memory was 207.5MB in the beginning and 205.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.85ms. Allocated memory is still 238.0MB. Free memory was 205.9MB in the beginning and 204.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 579.43ms. Allocated memory is still 238.0MB. Free memory was 204.4MB in the beginning and 182.9MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 733797.68ms. Allocated memory was 238.0MB in the beginning and 595.6MB in the end (delta: 357.6MB). Free memory was 182.3MB in the beginning and 326.1MB in the end (delta: -143.8MB). Peak memory consumption was 366.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 132 PlacesBefore, 24 PlacesAfterwards, 136 TransitionsBefore, 20 TransitionsAfterwards, 538 CoEnabledTransitionPairs, 8 FixpointIterations, 98 TrivialSequentialCompositions, 19 ConcurrentSequentialCompositions, 15 TrivialYvCompositions, 6 ConcurrentYvCompositions, 8 ChoiceCompositions, 146 TotalNumberOfCompositions, 789 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 642, positive: 605, positive conditional: 0, positive unconditional: 605, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 310, positive: 300, positive conditional: 0, positive unconditional: 300, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 642, positive: 305, positive conditional: 0, positive unconditional: 305, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 310, unknown conditional: 0, unknown unconditional: 310] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 16, Positive conditional cache size: 0, Positive unconditional cache size: 16, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - 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: 98]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 25 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 14ms.. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 25 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 14ms.. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 25 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 14ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 146 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 733.7s, OverallIterations: 108, TraceHistogramMax: 6, PathProgramHistogramMax: 90, EmptinessCheckTime: 0.1s, AutomataDifference: 205.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10398 SdHoareTripleChecker+Valid, 36.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10398 mSDsluCounter, 5356 SdHoareTripleChecker+Invalid, 31.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 46 IncrementalHoareTripleChecker+Unchecked, 16576 mSDsCounter, 5588 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 46617 IncrementalHoareTripleChecker+Invalid, 52251 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5588 mSolverCounterUnsat, 538 mSDtfsCounter, 46617 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8374 GetRequests, 3288 SyntacticMatches, 396 SemanticMatches, 4690 ConstructedPredicates, 30 IntricatePredicates, 0 DeprecatedPredicates, 50079 ImplicationChecksByTransitivity, 302.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=814occurred in iteration=77, InterpolantAutomatonStates: 2345, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 107 MinimizatonAttempts, 12587 StatesRemovedByMinimization, 102 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.2s SsaConstructionTime, 6.3s SatisfiabilityAnalysisTime, 139.4s InterpolantComputationTime, 4473 NumberOfCodeBlocks, 4440 NumberOfCodeBlocksAsserted, 340 NumberOfCheckSat, 6372 ConstructedInterpolants, 204 QuantifiedInterpolants, 141083 SizeOfPredicates, 1724 NumberOfNonLiveVariables, 25466 ConjunctsInSsa, 4321 ConjunctsInUnsatCore, 315 InterpolantComputations, 6 PerfectInterpolantSequences, 1379/4854 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