/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bc79526 [2022-01-18 12:17:17,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 12:17:17,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 12:17:17,145 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 12:17:17,146 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 12:17:17,148 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 12:17:17,152 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 12:17:17,155 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 12:17:17,156 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 12:17:17,160 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 12:17:17,161 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 12:17:17,162 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 12:17:17,162 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 12:17:17,164 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 12:17:17,165 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 12:17:17,168 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 12:17:17,168 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 12:17:17,169 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 12:17:17,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 12:17:17,176 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 12:17:17,176 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 12:17:17,177 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 12:17:17,179 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 12:17:17,179 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 12:17:17,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 12:17:17,185 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 12:17:17,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 12:17:17,186 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 12:17:17,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 12:17:17,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 12:17:17,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 12:17:17,188 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 12:17:17,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 12:17:17,190 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 12:17:17,192 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 12:17:17,192 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 12:17:17,192 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 12:17:17,192 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 12:17:17,193 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 12:17:17,193 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 12:17:17,194 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 12:17:17,195 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf [2022-01-18 12:17:17,222 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 12:17:17,222 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 12:17:17,223 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-18 12:17:17,223 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-18 12:17:17,224 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 12:17:17,224 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 12:17:17,224 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 12:17:17,224 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 12:17:17,225 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 12:17:17,225 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 12:17:17,225 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 12:17:17,226 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 12:17:17,226 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 12:17:17,226 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 12:17:17,226 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 12:17:17,226 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 12:17:17,226 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 12:17:17,227 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 12:17:17,227 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 12:17:17,227 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 12:17:17,227 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 12:17:17,227 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 12:17:17,227 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 12:17:17,227 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 12:17:17,228 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 12:17:17,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 12:17:17,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 12:17:17,228 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 12:17:17,228 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 12:17:17,228 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 12:17:17,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 12:17:17,229 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 12:17:17,229 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-18 12:17:17,229 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2022-01-18 12:17:17,229 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-18 12:17:17,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 12:17:17,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 12:17:17,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 12:17:17,485 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 12:17:17,485 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 12:17:17,486 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2022-01-18 12:17:17,536 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5cd57250/223cac4218274c16a70a09f14ab16bef/FLAG94ee01ec1 [2022-01-18 12:17:17,910 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 12:17:17,910 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2022-01-18 12:17:17,925 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5cd57250/223cac4218274c16a70a09f14ab16bef/FLAG94ee01ec1 [2022-01-18 12:17:18,309 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5cd57250/223cac4218274c16a70a09f14ab16bef [2022-01-18 12:17:18,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 12:17:18,313 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 12:17:18,316 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 12:17:18,316 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 12:17:18,319 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 12:17:18,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 12:17:18" (1/1) ... [2022-01-18 12:17:18,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5da56d80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:17:18, skipping insertion in model container [2022-01-18 12:17:18,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 12:17:18" (1/1) ... [2022-01-18 12:17:18,331 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 12:17:18,355 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 12:17:18,531 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c[3019,3032] [2022-01-18 12:17:18,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 12:17:18,556 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 12:17:18,596 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c[3019,3032] [2022-01-18 12:17:18,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 12:17:18,610 INFO L208 MainTranslator]: Completed translation [2022-01-18 12:17:18,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:17:18 WrapperNode [2022-01-18 12:17:18,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 12:17:18,612 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 12:17:18,612 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 12:17:18,612 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 12:17:18,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:17:18" (1/1) ... [2022-01-18 12:17:18,634 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:17:18" (1/1) ... [2022-01-18 12:17:18,665 INFO L137 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2022-01-18 12:17:18,665 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 12:17:18,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 12:17:18,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 12:17:18,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 12:17:18,673 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:17:18" (1/1) ... [2022-01-18 12:17:18,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:17:18" (1/1) ... [2022-01-18 12:17:18,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:17:18" (1/1) ... [2022-01-18 12:17:18,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:17:18" (1/1) ... [2022-01-18 12:17:18,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:17:18" (1/1) ... [2022-01-18 12:17:18,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:17:18" (1/1) ... [2022-01-18 12:17:18,706 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:17:18" (1/1) ... [2022-01-18 12:17:18,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 12:17:18,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 12:17:18,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 12:17:18,709 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 12:17:18,715 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:17:18" (1/1) ... [2022-01-18 12:17:18,721 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 12:17:18,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:17:18,749 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-01-18 12:17:18,771 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-01-18 12:17:18,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 12:17:18,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 12:17:18,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 12:17:18,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-18 12:17:18,795 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-18 12:17:18,795 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-18 12:17:18,796 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-18 12:17:18,796 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-18 12:17:18,796 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-18 12:17:18,796 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-18 12:17:18,796 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-01-18 12:17:18,796 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-01-18 12:17:18,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 12:17:18,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-18 12:17:18,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-18 12:17:18,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-18 12:17:18,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 12:17:18,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 12:17:18,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 12:17:18,798 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-18 12:17:18,919 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 12:17:18,920 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 12:17:19,142 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 12:17:19,211 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 12:17:19,211 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-18 12:17:19,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 12:17:19 BoogieIcfgContainer [2022-01-18 12:17:19,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 12:17:19,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 12:17:19,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 12:17:19,218 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 12:17:19,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 12:17:18" (1/3) ... [2022-01-18 12:17:19,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@256decf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 12:17:19, skipping insertion in model container [2022-01-18 12:17:19,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 12:17:18" (2/3) ... [2022-01-18 12:17:19,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@256decf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 12:17:19, skipping insertion in model container [2022-01-18 12:17:19,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 12:17:19" (3/3) ... [2022-01-18 12:17:19,220 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-min-max-dec.wvr.c [2022-01-18 12:17:19,224 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-18 12:17:19,224 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 12:17:19,224 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-18 12:17:19,224 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 12:17:19,261 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,262 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,262 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,262 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,262 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,262 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,263 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,263 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,263 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,263 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,263 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,263 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,264 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,264 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,264 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,264 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,264 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,265 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,265 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,265 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,265 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,265 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,266 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,266 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,266 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,266 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,266 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,266 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,267 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,267 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,267 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,267 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,267 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,268 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,268 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,268 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,268 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,268 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,269 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,269 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,269 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,269 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,269 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,269 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,269 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,270 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,270 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,270 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,270 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,271 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,271 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,271 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,271 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,271 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,272 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,272 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,272 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,272 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,272 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,272 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,272 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,273 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,273 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,273 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,273 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,273 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,273 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,274 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,274 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,274 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,274 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,274 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,275 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,275 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,275 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,275 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,275 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,275 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,275 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,275 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,276 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,276 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,276 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,276 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,276 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,276 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,277 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,277 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,277 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,278 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,278 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,278 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,278 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,278 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,278 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,278 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,279 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,279 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,279 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,280 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,282 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,282 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,282 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,282 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,282 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,282 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,282 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,283 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,283 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,283 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,284 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,284 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,284 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,284 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,284 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,285 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,285 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,285 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,285 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,286 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,286 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,286 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,286 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,286 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,286 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,286 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,286 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 12:17:19,307 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-01-18 12:17:19,359 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 12:17:19,365 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-18 12:17:19,365 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-18 12:17:19,377 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 173 places, 172 transitions, 376 flow [2022-01-18 12:17:20,682 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 26140 states, 26139 states have (on average 4.557289873369295) internal successors, (119123), 26139 states have internal predecessors, (119123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:17:20,801 INFO L276 IsEmpty]: Start isEmpty. Operand has 26140 states, 26139 states have (on average 4.557289873369295) internal successors, (119123), 26139 states have internal predecessors, (119123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:17:21,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-18 12:17:21,103 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:17:21,103 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 12:17:21,105 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 12:17:21,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:17:21,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1420994164, now seen corresponding path program 1 times [2022-01-18 12:17:21,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:17:21,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001830231] [2022-01-18 12:17:21,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:17:21,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:17:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:17:21,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:17:21,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:17:21,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001830231] [2022-01-18 12:17:21,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001830231] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 12:17:21,371 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 12:17:21,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 12:17:21,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094336486] [2022-01-18 12:17:21,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 12:17:21,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-18 12:17:21,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:17:21,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-18 12:17:21,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 12:17:21,459 INFO L87 Difference]: Start difference. First operand has 26140 states, 26139 states have (on average 4.557289873369295) internal successors, (119123), 26139 states have internal predecessors, (119123), 0 states have call successors, (0), 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 2 states, 2 states have (on average 60.5) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:17:21,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:17:21,876 INFO L93 Difference]: Finished difference Result 26140 states and 111710 transitions. [2022-01-18 12:17:21,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-18 12:17:21,878 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 60.5) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-01-18 12:17:21,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:17:22,190 INFO L225 Difference]: With dead ends: 26140 [2022-01-18 12:17:22,190 INFO L226 Difference]: Without dead ends: 26136 [2022-01-18 12:17:22,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 12:17:22,194 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 12:17:22,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 12:17:22,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26136 states. [2022-01-18 12:17:23,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26136 to 26136. [2022-01-18 12:17:23,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26136 states, 26135 states have (on average 4.274191696958102) internal successors, (111706), 26135 states have internal predecessors, (111706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:17:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26136 states to 26136 states and 111706 transitions. [2022-01-18 12:17:23,710 INFO L78 Accepts]: Start accepts. Automaton has 26136 states and 111706 transitions. Word has length 121 [2022-01-18 12:17:23,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:17:23,711 INFO L470 AbstractCegarLoop]: Abstraction has 26136 states and 111706 transitions. [2022-01-18 12:17:23,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 60.5) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:17:23,712 INFO L276 IsEmpty]: Start isEmpty. Operand 26136 states and 111706 transitions. [2022-01-18 12:17:23,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-18 12:17:24,000 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:17:24,001 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 12:17:24,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 12:17:24,002 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 12:17:24,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:17:24,006 INFO L85 PathProgramCache]: Analyzing trace with hash -507464182, now seen corresponding path program 1 times [2022-01-18 12:17:24,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:17:24,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444512831] [2022-01-18 12:17:24,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:17:24,007 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:17:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:17:24,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:17:24,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:17:24,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444512831] [2022-01-18 12:17:24,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444512831] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 12:17:24,297 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 12:17:24,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 12:17:24,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829517766] [2022-01-18 12:17:24,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 12:17:24,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 12:17:24,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:17:24,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 12:17:24,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-18 12:17:24,299 INFO L87 Difference]: Start difference. First operand 26136 states and 111706 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:17:24,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:17:24,813 INFO L93 Difference]: Finished difference Result 35136 states and 150562 transitions. [2022-01-18 12:17:24,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-18 12:17:24,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-01-18 12:17:24,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:17:25,179 INFO L225 Difference]: With dead ends: 35136 [2022-01-18 12:17:25,179 INFO L226 Difference]: Without dead ends: 35136 [2022-01-18 12:17:25,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-01-18 12:17:25,181 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 352 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 12:17:25,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 319 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 12:17:25,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35136 states. [2022-01-18 12:17:26,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35136 to 28386. [2022-01-18 12:17:26,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28386 states, 28385 states have (on average 4.277611414479479) internal successors, (121420), 28385 states have internal predecessors, (121420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:17:26,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28386 states to 28386 states and 121420 transitions. [2022-01-18 12:17:26,760 INFO L78 Accepts]: Start accepts. Automaton has 28386 states and 121420 transitions. Word has length 121 [2022-01-18 12:17:26,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:17:26,761 INFO L470 AbstractCegarLoop]: Abstraction has 28386 states and 121420 transitions. [2022-01-18 12:17:26,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:17:26,762 INFO L276 IsEmpty]: Start isEmpty. Operand 28386 states and 121420 transitions. [2022-01-18 12:17:26,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-01-18 12:17:26,843 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:17:26,843 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 12:17:26,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 12:17:26,843 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 12:17:26,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:17:26,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1313580435, now seen corresponding path program 1 times [2022-01-18 12:17:26,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:17:26,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821379316] [2022-01-18 12:17:26,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:17:26,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:17:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:17:26,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 12:17:26,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:17:26,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821379316] [2022-01-18 12:17:26,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821379316] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 12:17:26,977 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 12:17:26,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 12:17:26,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473848798] [2022-01-18 12:17:26,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 12:17:26,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 12:17:26,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:17:26,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 12:17:26,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-18 12:17:26,979 INFO L87 Difference]: Start difference. First operand 28386 states and 121420 transitions. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:17:27,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:17:27,358 INFO L93 Difference]: Finished difference Result 37401 states and 158042 transitions. [2022-01-18 12:17:27,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-18 12:17:27,359 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2022-01-18 12:17:27,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:17:27,490 INFO L225 Difference]: With dead ends: 37401 [2022-01-18 12:17:27,491 INFO L226 Difference]: Without dead ends: 28392 [2022-01-18 12:17:27,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-01-18 12:17:27,492 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 425 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 12:17:27,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [425 Valid, 475 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 12:17:27,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28392 states. [2022-01-18 12:17:28,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28392 to 28387. [2022-01-18 12:17:28,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28387 states, 28386 states have (on average 4.277495948707109) internal successors, (121421), 28386 states have internal predecessors, (121421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:17:28,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28387 states to 28387 states and 121421 transitions. [2022-01-18 12:17:28,920 INFO L78 Accepts]: Start accepts. Automaton has 28387 states and 121421 transitions. Word has length 126 [2022-01-18 12:17:28,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:17:28,920 INFO L470 AbstractCegarLoop]: Abstraction has 28387 states and 121421 transitions. [2022-01-18 12:17:28,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:17:28,920 INFO L276 IsEmpty]: Start isEmpty. Operand 28387 states and 121421 transitions. [2022-01-18 12:17:28,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-01-18 12:17:28,986 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:17:28,986 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 12:17:28,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-18 12:17:28,987 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 12:17:28,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:17:28,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1766570838, now seen corresponding path program 1 times [2022-01-18 12:17:28,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:17:28,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651082198] [2022-01-18 12:17:28,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:17:28,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:17:29,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:17:29,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:17:29,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:17:29,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651082198] [2022-01-18 12:17:29,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651082198] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:17:29,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519971018] [2022-01-18 12:17:29,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:17:29,088 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:17:29,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:17:29,095 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-01-18 12:17:29,099 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-01-18 12:17:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:17:29,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-18 12:17:29,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:17:29,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:17:29,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:17:29,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:17:29,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519971018] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-18 12:17:29,833 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-18 12:17:29,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-01-18 12:17:29,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983051260] [2022-01-18 12:17:29,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 12:17:29,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 12:17:29,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:17:29,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 12:17:29,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-01-18 12:17:29,835 INFO L87 Difference]: Start difference. First operand 28387 states and 121421 transitions. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:17:30,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:17:30,125 INFO L93 Difference]: Finished difference Result 30943 states and 132410 transitions. [2022-01-18 12:17:30,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 12:17:30,126 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2022-01-18 12:17:30,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:17:30,484 INFO L225 Difference]: With dead ends: 30943 [2022-01-18 12:17:30,485 INFO L226 Difference]: Without dead ends: 30943 [2022-01-18 12:17:30,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 258 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-01-18 12:17:30,486 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 280 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 12:17:30,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 368 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 12:17:30,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30943 states. [2022-01-18 12:17:31,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30943 to 30943. [2022-01-18 12:17:31,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30943 states, 30942 states have (on average 4.279296748755737) internal successors, (132410), 30942 states have internal predecessors, (132410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:17:31,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30943 states to 30943 states and 132410 transitions. [2022-01-18 12:17:31,370 INFO L78 Accepts]: Start accepts. Automaton has 30943 states and 132410 transitions. Word has length 133 [2022-01-18 12:17:31,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:17:31,370 INFO L470 AbstractCegarLoop]: Abstraction has 30943 states and 132410 transitions. [2022-01-18 12:17:31,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:17:31,371 INFO L276 IsEmpty]: Start isEmpty. Operand 30943 states and 132410 transitions. [2022-01-18 12:17:31,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-01-18 12:17:31,452 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:17:31,452 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 12:17:31,468 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-01-18 12:17:31,655 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-01-18 12:17:31,656 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 12:17:31,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:17:31,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1027911653, now seen corresponding path program 1 times [2022-01-18 12:17:31,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:17:31,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359245786] [2022-01-18 12:17:31,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:17:31,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:17:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:17:31,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:17:31,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:17:31,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359245786] [2022-01-18 12:17:31,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359245786] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:17:31,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134275246] [2022-01-18 12:17:31,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:17:31,787 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:17:31,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:17:31,788 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-01-18 12:17:31,813 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-01-18 12:17:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:17:31,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-18 12:17:31,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:17:32,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:17:32,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:17:32,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:17:32,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134275246] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-18 12:17:32,448 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-18 12:17:32,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-01-18 12:17:32,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603502104] [2022-01-18 12:17:32,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 12:17:32,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 12:17:32,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:17:32,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 12:17:32,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-01-18 12:17:32,450 INFO L87 Difference]: Start difference. First operand 30943 states and 132410 transitions. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:17:32,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:17:32,758 INFO L93 Difference]: Finished difference Result 34267 states and 146807 transitions. [2022-01-18 12:17:32,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 12:17:32,758 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2022-01-18 12:17:32,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:17:33,204 INFO L225 Difference]: With dead ends: 34267 [2022-01-18 12:17:33,204 INFO L226 Difference]: Without dead ends: 34267 [2022-01-18 12:17:33,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 268 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-01-18 12:17:33,206 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 240 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 12:17:33,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [240 Valid, 410 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 12:17:33,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34267 states. [2022-01-18 12:17:33,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34267 to 34267. [2022-01-18 12:17:33,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34267 states, 34266 states have (on average 4.284334325570536) internal successors, (146807), 34266 states have internal predecessors, (146807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:17:34,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34267 states to 34267 states and 146807 transitions. [2022-01-18 12:17:34,273 INFO L78 Accepts]: Start accepts. Automaton has 34267 states and 146807 transitions. Word has length 138 [2022-01-18 12:17:34,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:17:34,273 INFO L470 AbstractCegarLoop]: Abstraction has 34267 states and 146807 transitions. [2022-01-18 12:17:34,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:17:34,287 INFO L276 IsEmpty]: Start isEmpty. Operand 34267 states and 146807 transitions. [2022-01-18 12:17:34,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 12:17:34,406 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:17:34,406 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 12:17:34,423 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-01-18 12:17:34,609 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-01-18 12:17:34,609 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 12:17:34,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:17:34,610 INFO L85 PathProgramCache]: Analyzing trace with hash 334563494, now seen corresponding path program 1 times [2022-01-18 12:17:34,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:17:34,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711518829] [2022-01-18 12:17:34,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:17:34,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:17:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:17:35,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 12:17:35,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:17:35,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711518829] [2022-01-18 12:17:35,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711518829] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:17:35,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549921223] [2022-01-18 12:17:35,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:17:35,062 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:17:35,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:17:35,064 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-01-18 12:17:35,094 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-01-18 12:17:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:17:35,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 36 conjunts are in the unsatisfiable core [2022-01-18 12:17:35,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:17:35,458 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-18 12:17:35,578 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-01-18 12:17:35,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:17:35,726 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 12:17:35,756 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-18 12:17:35,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:17:35,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:17:36,149 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1))))) is different from false [2022-01-18 12:17:36,339 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (let ((.cse1 (< c_~min~0 .cse2)) (.cse3 (+ .cse0 1))) (and (or .cse1 (<= .cse2 .cse3)) (or (not .cse1) (<= c_~min~0 .cse3)))))))) is different from false [2022-01-18 12:17:36,400 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse1 (+ .cse0 1)) (.cse2 (< c_~min~0 .cse3))) (and (or (<= c_~min~0 .cse1) (not .cse2)) (or (<= .cse3 .cse1) .cse2))))))) is different from false [2022-01-18 12:17:36,444 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (<= (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (+ .cse0 1)) (<= 2147483647 .cse0)))) is different from false [2022-01-18 12:17:36,463 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse1 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) c_~A~0.base) c_~A~0.offset))) (or (<= (select (select .cse0 c_~A~0.base) c_~A~0.offset) (+ .cse1 1)) (<= 2147483647 .cse1))))) is different from false [2022-01-18 12:17:36,499 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse1 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|))) (or (<= (select (select .cse0 |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|) (+ .cse1 1)) (<= 2147483647 .cse1))))) is different from false [2022-01-18 12:17:36,525 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (<= 2147483647 .cse0) (<= (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (+ .cse0 1)))))) is different from false [2022-01-18 12:17:36,536 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= 2147483647 .cse0) (<= (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ .cse0 1)))))) is different from false [2022-01-18 12:17:36,595 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:17:36,595 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 48 [2022-01-18 12:17:36,600 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 383 treesize of output 343 [2022-01-18 12:17:36,611 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 86 treesize of output 80 [2022-01-18 12:17:36,615 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 77 treesize of output 65 [2022-01-18 12:17:36,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-01-18 12:17:36,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549921223] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:17:36,791 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:17:36,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 45 [2022-01-18 12:17:36,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789113935] [2022-01-18 12:17:36,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:17:36,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-01-18 12:17:36,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:17:36,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-01-18 12:17:36,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1225, Unknown=8, NotChecked=616, Total=1980 [2022-01-18 12:17:36,794 INFO L87 Difference]: Start difference. First operand 34267 states and 146807 transitions. Second operand has 45 states, 45 states have (on average 8.444444444444445) internal successors, (380), 45 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:17:44,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:17:44,599 INFO L93 Difference]: Finished difference Result 342390 states and 1478395 transitions. [2022-01-18 12:17:44,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-01-18 12:17:44,599 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 8.444444444444445) internal successors, (380), 45 states have internal predecessors, (380), 0 states have call successors, (0), 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 143 [2022-01-18 12:17:44,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:17:45,723 INFO L225 Difference]: With dead ends: 342390 [2022-01-18 12:17:45,723 INFO L226 Difference]: Without dead ends: 194157 [2022-01-18 12:17:45,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 259 SyntacticMatches, 8 SemanticMatches, 81 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1023 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1208, Invalid=4366, Unknown=8, NotChecked=1224, Total=6806 [2022-01-18 12:17:45,725 INFO L933 BasicCegarLoop]: 343 mSDtfsCounter, 1962 mSDsluCounter, 5657 mSDsCounter, 0 mSdLazyCounter, 1938 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1962 SdHoareTripleChecker+Valid, 5481 SdHoareTripleChecker+Invalid, 5862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3847 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-18 12:17:45,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1962 Valid, 5481 Invalid, 5862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1938 Invalid, 0 Unknown, 3847 Unchecked, 1.2s Time] [2022-01-18 12:17:46,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194157 states. [2022-01-18 12:17:49,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194157 to 35973. [2022-01-18 12:17:49,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35973 states, 35972 states have (on average 4.2384910485933505) internal successors, (152467), 35972 states have internal predecessors, (152467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:17:49,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35973 states to 35973 states and 152467 transitions. [2022-01-18 12:17:49,426 INFO L78 Accepts]: Start accepts. Automaton has 35973 states and 152467 transitions. Word has length 143 [2022-01-18 12:17:49,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:17:49,426 INFO L470 AbstractCegarLoop]: Abstraction has 35973 states and 152467 transitions. [2022-01-18 12:17:49,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 8.444444444444445) internal successors, (380), 45 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:17:49,426 INFO L276 IsEmpty]: Start isEmpty. Operand 35973 states and 152467 transitions. [2022-01-18 12:17:49,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 12:17:49,503 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:17:49,504 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 12:17:49,519 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-01-18 12:17:49,704 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-01-18 12:17:49,705 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 12:17:49,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:17:49,705 INFO L85 PathProgramCache]: Analyzing trace with hash 940179670, now seen corresponding path program 2 times [2022-01-18 12:17:49,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:17:49,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901240884] [2022-01-18 12:17:49,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:17:49,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:17:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:17:50,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 12:17:50,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:17:50,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901240884] [2022-01-18 12:17:50,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901240884] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:17:50,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231988805] [2022-01-18 12:17:50,646 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 12:17:50,646 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:17:50,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:17:50,647 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-01-18 12:17:50,648 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-01-18 12:17:50,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 12:17:50,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:17:50,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 37 conjunts are in the unsatisfiable core [2022-01-18 12:17:50,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:17:50,818 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-01-18 12:17:50,861 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-18 12:17:50,861 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-18 12:17:51,067 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 12:17:51,068 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 12:17:51,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:17:51,438 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 12:17:51,481 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 12:17:51,506 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-18 12:17:51,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 12:17:51,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:17:51,828 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_230 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0)))) is different from false [2022-01-18 12:17:51,868 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_230 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0)))) is different from false [2022-01-18 12:17:51,981 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_230 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (let ((.cse1 (< c_~min~0 .cse2)) (.cse3 (+ .cse0 1))) (and (or .cse1 (<= .cse2 .cse3)) (or (not .cse1) (<= c_~min~0 .cse3)))))))) is different from false [2022-01-18 12:17:52,046 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_230 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base) c_~A~0.offset))) (or (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse2 (+ .cse3 1)) (.cse0 (< c_~min~0 .cse1))) (and (or .cse0 (<= .cse1 .cse2)) (or (<= c_~min~0 .cse2) (not .cse0))))) (<= 2147483647 .cse3)))) is different from false [2022-01-18 12:17:52,085 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 247 treesize of output 215 [2022-01-18 12:17:52,089 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 207 treesize of output 199 [2022-01-18 12:17:52,093 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 199 treesize of output 183 [2022-01-18 12:17:52,754 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 10 treesize of output 8 [2022-01-18 12:17:52,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-01-18 12:17:52,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231988805] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:17:52,796 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:17:52,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 48 [2022-01-18 12:17:52,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795241472] [2022-01-18 12:17:52,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:17:52,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-01-18 12:17:52,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:17:52,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-01-18 12:17:52,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1711, Unknown=4, NotChecked=348, Total=2256 [2022-01-18 12:17:52,798 INFO L87 Difference]: Start difference. First operand 35973 states and 152467 transitions. Second operand has 48 states, 48 states have (on average 7.25) internal successors, (348), 48 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:18:10,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:18:10,106 INFO L93 Difference]: Finished difference Result 498918 states and 2148451 transitions. [2022-01-18 12:18:10,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-01-18 12:18:10,107 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 7.25) internal successors, (348), 48 states have internal predecessors, (348), 0 states have call successors, (0), 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 143 [2022-01-18 12:18:10,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:18:11,920 INFO L225 Difference]: With dead ends: 498918 [2022-01-18 12:18:11,921 INFO L226 Difference]: Without dead ends: 302240 [2022-01-18 12:18:11,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 263 SyntacticMatches, 7 SemanticMatches, 170 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 8592 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=6074, Invalid=21994, Unknown=4, NotChecked=1340, Total=29412 [2022-01-18 12:18:11,926 INFO L933 BasicCegarLoop]: 295 mSDtfsCounter, 2755 mSDsluCounter, 4763 mSDsCounter, 0 mSdLazyCounter, 2644 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2755 SdHoareTripleChecker+Valid, 4573 SdHoareTripleChecker+Invalid, 5812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 2644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2985 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-18 12:18:11,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2755 Valid, 4573 Invalid, 5812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 2644 Invalid, 0 Unknown, 2985 Unchecked, 1.6s Time] [2022-01-18 12:18:13,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302240 states. [2022-01-18 12:18:17,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302240 to 36184. [2022-01-18 12:18:17,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36184 states, 36183 states have (on average 4.237625404195341) internal successors, (153330), 36183 states have internal predecessors, (153330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:18:17,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36184 states to 36184 states and 153330 transitions. [2022-01-18 12:18:17,373 INFO L78 Accepts]: Start accepts. Automaton has 36184 states and 153330 transitions. Word has length 143 [2022-01-18 12:18:17,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:18:17,373 INFO L470 AbstractCegarLoop]: Abstraction has 36184 states and 153330 transitions. [2022-01-18 12:18:17,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 7.25) internal successors, (348), 48 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:18:17,374 INFO L276 IsEmpty]: Start isEmpty. Operand 36184 states and 153330 transitions. [2022-01-18 12:18:17,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 12:18:17,452 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:18:17,452 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 12:18:17,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-18 12:18:17,652 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-01-18 12:18:17,653 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 12:18:17,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:18:17,653 INFO L85 PathProgramCache]: Analyzing trace with hash -263687870, now seen corresponding path program 3 times [2022-01-18 12:18:17,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:18:17,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917368162] [2022-01-18 12:18:17,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:18:17,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:18:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:18:18,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:18:18,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:18:18,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917368162] [2022-01-18 12:18:18,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917368162] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:18:18,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662353007] [2022-01-18 12:18:18,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 12:18:18,143 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:18:18,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:18:18,144 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-01-18 12:18:18,144 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-01-18 12:18:18,259 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-18 12:18:18,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:18:18,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 42 conjunts are in the unsatisfiable core [2022-01-18 12:18:18,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:18:19,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:18:19,021 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 12:18:19,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:18:19,109 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 12:18:19,185 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-01-18 12:18:19,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:18:19,280 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 16 treesize of output 18 [2022-01-18 12:18:19,310 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-01-18 12:18:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:18:19,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:18:19,543 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_279 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_279) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1))))) is different from false [2022-01-18 12:18:19,621 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_279 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| c_~A~0.base)) (.cse2 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|)))) (let ((.cse0 (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse1 .cse2 v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_279) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1)) (not (<= (select .cse1 .cse2) (+ v_ArrVal_278 1))))))) is different from false [2022-01-18 12:18:19,646 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_279 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| c_~A~0.base))) (let ((.cse0 (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_279) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_278 1))) (<= c_~min~0 (+ .cse0 1)))))) is different from false [2022-01-18 12:18:19,684 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_276))) (let ((.cse1 (select .cse2 c_~A~0.base))) (let ((.cse0 (select (select (store (store .cse2 c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_279) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_278 1)))))))) is different from false [2022-01-18 12:18:19,776 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_276))) (let ((.cse1 (select .cse2 c_~A~0.base))) (let ((.cse0 (select (select (store (store .cse2 c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_279) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1)) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_278 1)))))))) is different from false [2022-01-18 12:18:20,513 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_276))) (let ((.cse4 (select .cse5 c_~A~0.base))) (let ((.cse0 (select (select (store (store .cse5 c_~A~0.base (store .cse4 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_279) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (let ((.cse1 (< c_~min~0 .cse3)) (.cse2 (+ .cse0 1))) (and (or (not .cse1) (<= c_~min~0 .cse2)) (or .cse1 (<= .cse3 .cse2))))) (not (<= (select .cse4 c_~A~0.offset) (+ v_ArrVal_278 1)))))))) is different from false [2022-01-18 12:18:20,688 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 Int) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_276))) (let ((.cse1 (select .cse5 c_~A~0.base))) (let ((.cse0 (select (select (store (store .cse5 c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_278)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_279) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_278 1))) (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse4 (+ .cse0 1)) (.cse2 (< c_~min~0 .cse3))) (and (or .cse2 (<= .cse3 .cse4)) (or (<= c_~min~0 .cse4) (not .cse2)))))))))) is different from false [2022-01-18 12:18:20,775 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 315 treesize of output 279 [2022-01-18 12:18:20,780 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 219 treesize of output 203 [2022-01-18 12:18:20,785 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 60 treesize of output 58 [2022-01-18 12:18:20,789 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 58 treesize of output 54 [2022-01-18 12:18:21,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-01-18 12:18:21,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662353007] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:18:21,571 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:18:21,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 55 [2022-01-18 12:18:21,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075551847] [2022-01-18 12:18:21,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:18:21,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-01-18 12:18:21,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:18:21,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-01-18 12:18:21,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=2058, Unknown=7, NotChecked=686, Total=2970 [2022-01-18 12:18:21,574 INFO L87 Difference]: Start difference. First operand 36184 states and 153330 transitions. Second operand has 55 states, 55 states have (on average 6.363636363636363) internal successors, (350), 55 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:18:31,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:18:31,803 INFO L93 Difference]: Finished difference Result 401922 states and 1744153 transitions. [2022-01-18 12:18:31,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-01-18 12:18:31,803 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 6.363636363636363) internal successors, (350), 55 states have internal predecessors, (350), 0 states have call successors, (0), 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 143 [2022-01-18 12:18:31,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:18:33,436 INFO L225 Difference]: With dead ends: 401922 [2022-01-18 12:18:33,436 INFO L226 Difference]: Without dead ends: 274414 [2022-01-18 12:18:33,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 253 SyntacticMatches, 12 SemanticMatches, 116 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=2625, Invalid=9606, Unknown=7, NotChecked=1568, Total=13806 [2022-01-18 12:18:33,439 INFO L933 BasicCegarLoop]: 419 mSDtfsCounter, 4056 mSDsluCounter, 6138 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4056 SdHoareTripleChecker+Valid, 6113 SdHoareTripleChecker+Invalid, 7407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4873 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-18 12:18:33,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4056 Valid, 6113 Invalid, 7407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 2264 Invalid, 0 Unknown, 4873 Unchecked, 1.3s Time] [2022-01-18 12:18:34,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274414 states. [2022-01-18 12:18:37,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274414 to 35948. [2022-01-18 12:18:38,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35948 states, 35947 states have (on average 4.235346482321195) internal successors, (152248), 35947 states have internal predecessors, (152248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:18:38,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35948 states to 35948 states and 152248 transitions. [2022-01-18 12:18:38,571 INFO L78 Accepts]: Start accepts. Automaton has 35948 states and 152248 transitions. Word has length 143 [2022-01-18 12:18:38,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:18:38,571 INFO L470 AbstractCegarLoop]: Abstraction has 35948 states and 152248 transitions. [2022-01-18 12:18:38,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 6.363636363636363) internal successors, (350), 55 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:18:38,572 INFO L276 IsEmpty]: Start isEmpty. Operand 35948 states and 152248 transitions. [2022-01-18 12:18:38,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 12:18:38,713 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:18:38,713 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 12:18:38,730 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-01-18 12:18:38,914 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-01-18 12:18:38,914 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 12:18:38,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:18:38,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1870998198, now seen corresponding path program 4 times [2022-01-18 12:18:38,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:18:38,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233214766] [2022-01-18 12:18:38,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:18:38,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:18:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:18:39,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-18 12:18:39,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:18:39,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233214766] [2022-01-18 12:18:39,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233214766] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 12:18:39,031 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 12:18:39,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 12:18:39,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471345250] [2022-01-18 12:18:39,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 12:18:39,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 12:18:39,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:18:39,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 12:18:39,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 12:18:39,032 INFO L87 Difference]: Start difference. First operand 35948 states and 152248 transitions. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:18:39,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:18:39,461 INFO L93 Difference]: Finished difference Result 51353 states and 219409 transitions. [2022-01-18 12:18:39,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 12:18:39,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-18 12:18:39,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:18:39,574 INFO L225 Difference]: With dead ends: 51353 [2022-01-18 12:18:39,574 INFO L226 Difference]: Without dead ends: 32549 [2022-01-18 12:18:39,575 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-18 12:18:39,575 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 56 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 12:18:39,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 698 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 12:18:39,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32549 states. [2022-01-18 12:18:40,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32549 to 32426. [2022-01-18 12:18:40,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32426 states, 32425 states have (on average 4.1830377794911335) internal successors, (135635), 32425 states have internal predecessors, (135635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:18:40,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32426 states to 32426 states and 135635 transitions. [2022-01-18 12:18:40,790 INFO L78 Accepts]: Start accepts. Automaton has 32426 states and 135635 transitions. Word has length 143 [2022-01-18 12:18:40,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:18:40,790 INFO L470 AbstractCegarLoop]: Abstraction has 32426 states and 135635 transitions. [2022-01-18 12:18:40,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:18:40,790 INFO L276 IsEmpty]: Start isEmpty. Operand 32426 states and 135635 transitions. [2022-01-18 12:18:40,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 12:18:40,855 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:18:40,856 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 12:18:40,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-18 12:18:40,856 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 12:18:40,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:18:40,856 INFO L85 PathProgramCache]: Analyzing trace with hash -342153556, now seen corresponding path program 5 times [2022-01-18 12:18:40,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:18:40,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854688843] [2022-01-18 12:18:40,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:18:40,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:18:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:18:41,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 12:18:41,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:18:41,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854688843] [2022-01-18 12:18:41,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854688843] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:18:41,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859218553] [2022-01-18 12:18:41,013 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 12:18:41,013 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:18:41,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:18:41,014 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-01-18 12:18:41,016 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-01-18 12:18:41,152 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-01-18 12:18:41,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:18:41,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-18 12:18:41,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:18:41,420 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-18 12:18:41,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 12:18:41,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:18:41,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 12:18:41,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859218553] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:18:41,910 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:18:41,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 9] total 23 [2022-01-18 12:18:41,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510958027] [2022-01-18 12:18:41,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:18:41,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-18 12:18:41,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:18:41,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-18 12:18:41,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2022-01-18 12:18:41,912 INFO L87 Difference]: Start difference. First operand 32426 states and 135635 transitions. Second operand has 23 states, 23 states have (on average 11.73913043478261) internal successors, (270), 23 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:18:45,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:18:45,904 INFO L93 Difference]: Finished difference Result 268223 states and 1151796 transitions. [2022-01-18 12:18:45,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-01-18 12:18:45,904 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 11.73913043478261) internal successors, (270), 23 states have internal predecessors, (270), 0 states have call successors, (0), 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 143 [2022-01-18 12:18:45,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:18:46,519 INFO L225 Difference]: With dead ends: 268223 [2022-01-18 12:18:46,519 INFO L226 Difference]: Without dead ends: 119321 [2022-01-18 12:18:46,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1185, Invalid=3927, Unknown=0, NotChecked=0, Total=5112 [2022-01-18 12:18:46,521 INFO L933 BasicCegarLoop]: 341 mSDtfsCounter, 1601 mSDsluCounter, 3858 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1601 SdHoareTripleChecker+Valid, 3900 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-18 12:18:46,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1601 Valid, 3900 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-18 12:18:47,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119321 states. [2022-01-18 12:18:49,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119321 to 36452. [2022-01-18 12:18:49,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36452 states, 36451 states have (on average 4.1564017448080985) internal successors, (151505), 36451 states have internal predecessors, (151505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:18:49,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36452 states to 36452 states and 151505 transitions. [2022-01-18 12:18:49,195 INFO L78 Accepts]: Start accepts. Automaton has 36452 states and 151505 transitions. Word has length 143 [2022-01-18 12:18:49,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:18:49,195 INFO L470 AbstractCegarLoop]: Abstraction has 36452 states and 151505 transitions. [2022-01-18 12:18:49,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 11.73913043478261) internal successors, (270), 23 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:18:49,195 INFO L276 IsEmpty]: Start isEmpty. Operand 36452 states and 151505 transitions. [2022-01-18 12:18:49,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 12:18:49,274 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:18:49,274 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 12:18:49,296 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-01-18 12:18:49,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:18:49,496 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 12:18:49,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:18:49,496 INFO L85 PathProgramCache]: Analyzing trace with hash 627705186, now seen corresponding path program 6 times [2022-01-18 12:18:49,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:18:49,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805327598] [2022-01-18 12:18:49,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:18:49,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:18:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:18:49,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:18:49,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:18:49,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805327598] [2022-01-18 12:18:49,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805327598] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:18:49,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10322238] [2022-01-18 12:18:49,790 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-18 12:18:49,790 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:18:49,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:18:49,792 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-01-18 12:18:49,823 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-01-18 12:18:49,924 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-01-18 12:18:49,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:18:49,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 44 conjunts are in the unsatisfiable core [2022-01-18 12:18:49,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:18:49,955 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-01-18 12:18:49,982 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-18 12:18:49,983 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-18 12:18:50,028 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 12:18:50,029 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-18 12:18:50,237 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 12:18:50,305 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-01-18 12:18:50,437 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-01-18 12:18:50,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:18:50,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:18:50,977 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_392 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_392) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 2))) (<= 2147483647 c_~max~0)) is different from false [2022-01-18 12:18:51,011 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-01-18 12:18:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-01-18 12:18:51,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10322238] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:18:51,154 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:18:51,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 39 [2022-01-18 12:18:51,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674818798] [2022-01-18 12:18:51,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:18:51,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-01-18 12:18:51,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:18:51,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-01-18 12:18:51,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1254, Unknown=1, NotChecked=72, Total=1482 [2022-01-18 12:18:51,156 INFO L87 Difference]: Start difference. First operand 36452 states and 151505 transitions. Second operand has 39 states, 39 states have (on average 8.307692307692308) internal successors, (324), 39 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:18:55,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:18:55,922 INFO L93 Difference]: Finished difference Result 234838 states and 1000648 transitions. [2022-01-18 12:18:55,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-01-18 12:18:55,922 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 8.307692307692308) internal successors, (324), 39 states have internal predecessors, (324), 0 states have call successors, (0), 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 143 [2022-01-18 12:18:55,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:18:57,372 INFO L225 Difference]: With dead ends: 234838 [2022-01-18 12:18:57,373 INFO L226 Difference]: Without dead ends: 165746 [2022-01-18 12:18:57,373 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 278 SyntacticMatches, 9 SemanticMatches, 83 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1713 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1443, Invalid=5532, Unknown=1, NotChecked=164, Total=7140 [2022-01-18 12:18:57,374 INFO L933 BasicCegarLoop]: 380 mSDtfsCounter, 2567 mSDsluCounter, 5725 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2567 SdHoareTripleChecker+Valid, 5652 SdHoareTripleChecker+Invalid, 2354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 559 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-18 12:18:57,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2567 Valid, 5652 Invalid, 2354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1676 Invalid, 0 Unknown, 559 Unchecked, 0.8s Time] [2022-01-18 12:18:57,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165746 states. [2022-01-18 12:18:59,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165746 to 36165. [2022-01-18 12:18:59,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36165 states, 36164 states have (on average 4.155375511558456) internal successors, (150275), 36164 states have internal predecessors, (150275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:18:59,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36165 states to 36165 states and 150275 transitions. [2022-01-18 12:18:59,830 INFO L78 Accepts]: Start accepts. Automaton has 36165 states and 150275 transitions. Word has length 143 [2022-01-18 12:18:59,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:18:59,830 INFO L470 AbstractCegarLoop]: Abstraction has 36165 states and 150275 transitions. [2022-01-18 12:18:59,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 8.307692307692308) internal successors, (324), 39 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:18:59,830 INFO L276 IsEmpty]: Start isEmpty. Operand 36165 states and 150275 transitions. [2022-01-18 12:18:59,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 12:18:59,904 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:18:59,904 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 12:18:59,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-01-18 12:19:00,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:19:00,105 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 12:19:00,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:19:00,105 INFO L85 PathProgramCache]: Analyzing trace with hash 296544674, now seen corresponding path program 7 times [2022-01-18 12:19:00,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:19:00,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054201421] [2022-01-18 12:19:00,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:19:00,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:19:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:19:00,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:19:00,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:19:00,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054201421] [2022-01-18 12:19:00,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054201421] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:19:00,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511476358] [2022-01-18 12:19:00,342 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-18 12:19:00,342 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:19:00,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:19:00,344 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-01-18 12:19:00,377 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-01-18 12:19:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:19:00,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 22 conjunts are in the unsatisfiable core [2022-01-18 12:19:00,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:19:00,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:19:00,679 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 12:19:00,731 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-01-18 12:19:00,805 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:19:00,805 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 43 [2022-01-18 12:19:00,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:19:00,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:19:02,970 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_441 Int) (thread1Thread1of1ForFork0_~i~0 Int) (v_ArrVal_439 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_439) c_~A~0.base))) (let ((.cse0 (select (store .cse1 c_~A~0.offset v_ArrVal_441) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< v_ArrVal_441 .cse0) (<= .cse0 (+ c_~max~0 1)) (not (<= (+ v_ArrVal_441 1) (select .cse1 c_~A~0.offset))))))) (<= 2147483647 c_~max~0)) is different from false [2022-01-18 12:19:03,062 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 106 [2022-01-18 12:19:03,069 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:19:03,069 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 88 [2022-01-18 12:19:03,078 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:19:03,078 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 119 [2022-01-18 12:19:03,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-01-18 12:19:03,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511476358] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:19:03,308 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:19:03,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 39 [2022-01-18 12:19:03,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134144333] [2022-01-18 12:19:03,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:19:03,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-01-18 12:19:03,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:19:03,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-01-18 12:19:03,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1264, Unknown=2, NotChecked=72, Total=1482 [2022-01-18 12:19:03,310 INFO L87 Difference]: Start difference. First operand 36165 states and 150275 transitions. Second operand has 39 states, 39 states have (on average 8.333333333333334) internal successors, (325), 39 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:19:04,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:19:04,622 INFO L93 Difference]: Finished difference Result 63383 states and 265670 transitions. [2022-01-18 12:19:04,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-18 12:19:04,623 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 8.333333333333334) internal successors, (325), 39 states have internal predecessors, (325), 0 states have call successors, (0), 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 143 [2022-01-18 12:19:04,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:19:04,751 INFO L225 Difference]: With dead ends: 63383 [2022-01-18 12:19:04,751 INFO L226 Difference]: Without dead ends: 36325 [2022-01-18 12:19:04,751 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 272 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=478, Invalid=2716, Unknown=2, NotChecked=110, Total=3306 [2022-01-18 12:19:04,752 INFO L933 BasicCegarLoop]: 236 mSDtfsCounter, 1183 mSDsluCounter, 3546 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1183 SdHoareTripleChecker+Valid, 3574 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 524 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-18 12:19:04,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1183 Valid, 3574 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 745 Invalid, 0 Unknown, 524 Unchecked, 0.3s Time] [2022-01-18 12:19:04,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36325 states. [2022-01-18 12:19:05,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36325 to 35765. [2022-01-18 12:19:05,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35765 states, 35764 states have (on average 4.158231741415949) internal successors, (148715), 35764 states have internal predecessors, (148715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:19:06,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35765 states to 35765 states and 148715 transitions. [2022-01-18 12:19:06,020 INFO L78 Accepts]: Start accepts. Automaton has 35765 states and 148715 transitions. Word has length 143 [2022-01-18 12:19:06,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:19:06,020 INFO L470 AbstractCegarLoop]: Abstraction has 35765 states and 148715 transitions. [2022-01-18 12:19:06,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 8.333333333333334) internal successors, (325), 39 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:19:06,021 INFO L276 IsEmpty]: Start isEmpty. Operand 35765 states and 148715 transitions. [2022-01-18 12:19:06,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 12:19:06,098 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:19:06,098 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 12:19:06,121 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-01-18 12:19:06,321 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,SelfDestructingSolverStorable11 [2022-01-18 12:19:06,321 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 12:19:06,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:19:06,322 INFO L85 PathProgramCache]: Analyzing trace with hash 929095160, now seen corresponding path program 8 times [2022-01-18 12:19:06,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:19:06,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334738378] [2022-01-18 12:19:06,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:19:06,322 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:19:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:19:06,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:19:06,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:19:06,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334738378] [2022-01-18 12:19:06,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334738378] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:19:06,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403607605] [2022-01-18 12:19:06,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 12:19:06,611 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:19:06,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:19:06,612 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-01-18 12:19:06,613 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-01-18 12:19:06,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 12:19:06,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:19:06,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 49 conjunts are in the unsatisfiable core [2022-01-18 12:19:06,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:19:06,743 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-01-18 12:19:06,766 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-18 12:19:06,766 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-18 12:19:06,933 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-18 12:19:06,933 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-01-18 12:19:07,292 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 12:19:07,361 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 28 treesize of output 16 [2022-01-18 12:19:07,441 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 16 treesize of output 18 [2022-01-18 12:19:07,550 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-01-18 12:19:07,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 12:19:07,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:19:07,968 WARN L838 $PredicateComparison]: unable to prove that (or (<= 2147483647 c_~max~0) (forall ((v_ArrVal_491 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_491) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1)))) is different from false [2022-01-18 12:19:08,019 WARN L838 $PredicateComparison]: unable to prove that (or (<= 2147483647 c_~max~0) (forall ((v_ArrVal_489 Int) (v_ArrVal_491 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| c_~A~0.base)) (.cse1 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|)))) (or (<= (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse0 .cse1 v_ArrVal_489)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_491) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1)) (not (<= (+ v_ArrVal_489 1) (select .cse0 .cse1))))))) is different from false [2022-01-18 12:19:08,040 WARN L838 $PredicateComparison]: unable to prove that (or (<= 2147483647 c_~max~0) (forall ((v_ArrVal_489 Int) (v_ArrVal_491 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| c_~A~0.base))) (or (<= (select (select (store (store |c_#memory_int| c_~A~0.base (store .cse0 c_~A~0.offset v_ArrVal_489)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_491) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1)) (not (<= (+ v_ArrVal_489 1) (select .cse0 c_~A~0.offset))))))) is different from false [2022-01-18 12:19:08,061 WARN L838 $PredicateComparison]: unable to prove that (or (<= 2147483647 c_~max~0) (forall ((v_ArrVal_489 Int) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_488))) (let ((.cse0 (select .cse1 c_~A~0.base))) (or (not (<= (+ v_ArrVal_489 1) (select .cse0 c_~A~0.offset))) (<= (select (select (store (store .cse1 c_~A~0.base (store .cse0 c_~A~0.offset v_ArrVal_489)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_491) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1))))))) is different from false [2022-01-18 12:19:08,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 105 treesize of output 81 [2022-01-18 12:19:08,142 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 54 treesize of output 50 [2022-01-18 12:19:08,145 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 22 [2022-01-18 12:19:08,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-01-18 12:19:08,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403607605] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:19:08,491 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:19:08,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 20] total 45 [2022-01-18 12:19:08,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999674793] [2022-01-18 12:19:08,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:19:08,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-01-18 12:19:08,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:19:08,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-01-18 12:19:08,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1498, Unknown=4, NotChecked=324, Total=1980 [2022-01-18 12:19:08,493 INFO L87 Difference]: Start difference. First operand 35765 states and 148715 transitions. Second operand has 45 states, 45 states have (on average 7.666666666666667) internal successors, (345), 45 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:19:13,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:19:13,782 INFO L93 Difference]: Finished difference Result 210264 states and 905061 transitions. [2022-01-18 12:19:13,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-01-18 12:19:13,782 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 7.666666666666667) internal successors, (345), 45 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-01-18 12:19:13,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:19:15,266 INFO L225 Difference]: With dead ends: 210264 [2022-01-18 12:19:15,266 INFO L226 Difference]: Without dead ends: 107328 [2022-01-18 12:19:15,267 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 263 SyntacticMatches, 5 SemanticMatches, 92 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1601 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1826, Invalid=6196, Unknown=4, NotChecked=716, Total=8742 [2022-01-18 12:19:15,269 INFO L933 BasicCegarLoop]: 406 mSDtfsCounter, 2789 mSDsluCounter, 5579 mSDsCounter, 0 mSdLazyCounter, 1967 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2789 SdHoareTripleChecker+Valid, 5619 SdHoareTripleChecker+Invalid, 4155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2043 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-18 12:19:15,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2789 Valid, 5619 Invalid, 4155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1967 Invalid, 0 Unknown, 2043 Unchecked, 1.2s Time] [2022-01-18 12:19:15,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107328 states. [2022-01-18 12:19:17,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107328 to 30968. [2022-01-18 12:19:17,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30968 states, 30967 states have (on average 4.143798236832757) internal successors, (128321), 30967 states have internal predecessors, (128321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:19:17,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30968 states to 30968 states and 128321 transitions. [2022-01-18 12:19:17,636 INFO L78 Accepts]: Start accepts. Automaton has 30968 states and 128321 transitions. Word has length 143 [2022-01-18 12:19:17,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:19:17,637 INFO L470 AbstractCegarLoop]: Abstraction has 30968 states and 128321 transitions. [2022-01-18 12:19:17,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 7.666666666666667) internal successors, (345), 45 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:19:17,637 INFO L276 IsEmpty]: Start isEmpty. Operand 30968 states and 128321 transitions. [2022-01-18 12:19:17,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-18 12:19:17,800 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:19:17,800 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 12:19:17,839 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-01-18 12:19:18,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-18 12:19:18,027 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 12:19:18,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:19:18,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1049396362, now seen corresponding path program 9 times [2022-01-18 12:19:18,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:19:18,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857360129] [2022-01-18 12:19:18,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:19:18,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:19:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:19:18,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 12:19:18,107 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:19:18,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857360129] [2022-01-18 12:19:18,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857360129] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:19:18,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37779628] [2022-01-18 12:19:18,107 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 12:19:18,107 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:19:18,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:19:18,108 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-01-18 12:19:18,112 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-01-18 12:19:18,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-18 12:19:18,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:19:18,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-18 12:19:18,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:19:18,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 12:19:18,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:19:18,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 12:19:18,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37779628] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:19:18,659 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:19:18,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-01-18 12:19:18,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467564639] [2022-01-18 12:19:18,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:19:18,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-18 12:19:18,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:19:18,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-18 12:19:18,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-18 12:19:18,661 INFO L87 Difference]: Start difference. First operand 30968 states and 128321 transitions. Second operand has 9 states, 9 states have (on average 33.666666666666664) internal successors, (303), 9 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:19:18,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:19:18,964 INFO L93 Difference]: Finished difference Result 41375 states and 173574 transitions. [2022-01-18 12:19:18,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 12:19:18,964 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 33.666666666666664) internal successors, (303), 9 states have internal predecessors, (303), 0 states have call successors, (0), 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 143 [2022-01-18 12:19:18,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:19:19,050 INFO L225 Difference]: With dead ends: 41375 [2022-01-18 12:19:19,050 INFO L226 Difference]: Without dead ends: 24774 [2022-01-18 12:19:19,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-01-18 12:19:19,051 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 54 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 12:19:19,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 799 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 12:19:19,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24774 states. [2022-01-18 12:19:19,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24774 to 24764. [2022-01-18 12:19:19,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24764 states, 24763 states have (on average 4.126277106974115) internal successors, (102179), 24763 states have internal predecessors, (102179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:19:20,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24764 states to 24764 states and 102179 transitions. [2022-01-18 12:19:20,057 INFO L78 Accepts]: Start accepts. Automaton has 24764 states and 102179 transitions. Word has length 143 [2022-01-18 12:19:20,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:19:20,057 INFO L470 AbstractCegarLoop]: Abstraction has 24764 states and 102179 transitions. [2022-01-18 12:19:20,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 33.666666666666664) internal successors, (303), 9 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:19:20,057 INFO L276 IsEmpty]: Start isEmpty. Operand 24764 states and 102179 transitions. [2022-01-18 12:19:20,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-01-18 12:19:20,107 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:19:20,107 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 12:19:20,123 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-01-18 12:19:20,308 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,SelfDestructingSolverStorable13 [2022-01-18 12:19:20,308 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 12:19:20,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:19:20,309 INFO L85 PathProgramCache]: Analyzing trace with hash 225436057, now seen corresponding path program 10 times [2022-01-18 12:19:20,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:19:20,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83906700] [2022-01-18 12:19:20,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:19:20,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:19:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:19:20,419 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 12:19:20,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:19:20,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83906700] [2022-01-18 12:19:20,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83906700] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:19:20,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164967790] [2022-01-18 12:19:20,420 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 12:19:20,420 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:19:20,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:19:20,424 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-01-18 12:19:20,454 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-01-18 12:19:20,537 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 12:19:20,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:19:20,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-18 12:19:20,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:19:20,791 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 12:19:20,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:19:21,075 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 12:19:21,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164967790] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:19:21,075 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:19:21,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-01-18 12:19:21,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856779963] [2022-01-18 12:19:21,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:19:21,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-18 12:19:21,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:19:21,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-18 12:19:21,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2022-01-18 12:19:21,076 INFO L87 Difference]: Start difference. First operand 24764 states and 102179 transitions. Second operand has 24 states, 24 states have (on average 8.208333333333334) internal successors, (197), 24 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:19:21,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:19:21,508 INFO L93 Difference]: Finished difference Result 26364 states and 106354 transitions. [2022-01-18 12:19:21,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-18 12:19:21,508 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.208333333333334) internal successors, (197), 24 states have internal predecessors, (197), 0 states have call successors, (0), 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 148 [2022-01-18 12:19:21,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:19:21,583 INFO L225 Difference]: With dead ends: 26364 [2022-01-18 12:19:21,584 INFO L226 Difference]: Without dead ends: 24776 [2022-01-18 12:19:21,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 282 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=305, Invalid=955, Unknown=0, NotChecked=0, Total=1260 [2022-01-18 12:19:21,585 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 1074 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-18 12:19:21,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1074 Valid, 1520 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-18 12:19:21,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24776 states. [2022-01-18 12:19:22,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24776 to 24771. [2022-01-18 12:19:22,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24771 states, 24770 states have (on average 4.125393621316108) internal successors, (102186), 24770 states have internal predecessors, (102186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:19:22,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24771 states to 24771 states and 102186 transitions. [2022-01-18 12:19:22,512 INFO L78 Accepts]: Start accepts. Automaton has 24771 states and 102186 transitions. Word has length 148 [2022-01-18 12:19:22,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:19:22,527 INFO L470 AbstractCegarLoop]: Abstraction has 24771 states and 102186 transitions. [2022-01-18 12:19:22,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.208333333333334) internal successors, (197), 24 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:19:22,528 INFO L276 IsEmpty]: Start isEmpty. Operand 24771 states and 102186 transitions. [2022-01-18 12:19:22,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-01-18 12:19:22,581 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:19:22,582 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 12:19:22,601 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-01-18 12:19:22,793 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,SelfDestructingSolverStorable14 [2022-01-18 12:19:22,794 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 12:19:22,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:19:22,794 INFO L85 PathProgramCache]: Analyzing trace with hash 174308802, now seen corresponding path program 11 times [2022-01-18 12:19:22,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:19:22,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267345106] [2022-01-18 12:19:22,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:19:22,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:19:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:19:22,899 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-18 12:19:22,900 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:19:22,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267345106] [2022-01-18 12:19:22,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267345106] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:19:22,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045229383] [2022-01-18 12:19:22,900 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-18 12:19:22,901 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:19:22,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:19:22,902 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-01-18 12:19:22,903 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-01-18 12:19:23,029 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-01-18 12:19:23,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:19:23,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-18 12:19:23,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:19:23,307 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-18 12:19:23,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:19:23,493 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-18 12:19:23,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045229383] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:19:23,494 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:19:23,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2022-01-18 12:19:23,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784318494] [2022-01-18 12:19:23,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:19:23,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-18 12:19:23,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:19:23,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-18 12:19:23,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-01-18 12:19:23,496 INFO L87 Difference]: Start difference. First operand 24771 states and 102186 transitions. Second operand has 21 states, 21 states have (on average 10.666666666666666) internal successors, (224), 21 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:19:24,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:19:24,284 INFO L93 Difference]: Finished difference Result 40910 states and 170712 transitions. [2022-01-18 12:19:24,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-18 12:19:24,284 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 10.666666666666666) internal successors, (224), 21 states have internal predecessors, (224), 0 states have call successors, (0), 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 155 [2022-01-18 12:19:24,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:19:24,418 INFO L225 Difference]: With dead ends: 40910 [2022-01-18 12:19:24,418 INFO L226 Difference]: Without dead ends: 40910 [2022-01-18 12:19:24,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=297, Invalid=1185, Unknown=0, NotChecked=0, Total=1482 [2022-01-18 12:19:24,419 INFO L933 BasicCegarLoop]: 248 mSDtfsCounter, 1009 mSDsluCounter, 2599 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1009 SdHoareTripleChecker+Valid, 2549 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-18 12:19:24,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1009 Valid, 2549 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-18 12:19:24,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40910 states. [2022-01-18 12:19:25,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40910 to 34779. [2022-01-18 12:19:25,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34779 states, 34778 states have (on average 4.162574041060441) internal successors, (144766), 34778 states have internal predecessors, (144766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:19:25,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34779 states to 34779 states and 144766 transitions. [2022-01-18 12:19:25,512 INFO L78 Accepts]: Start accepts. Automaton has 34779 states and 144766 transitions. Word has length 155 [2022-01-18 12:19:25,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:19:25,513 INFO L470 AbstractCegarLoop]: Abstraction has 34779 states and 144766 transitions. [2022-01-18 12:19:25,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.666666666666666) internal successors, (224), 21 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:19:25,513 INFO L276 IsEmpty]: Start isEmpty. Operand 34779 states and 144766 transitions. [2022-01-18 12:19:25,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-18 12:19:25,586 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:19:25,586 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 12:19:25,601 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-01-18 12:19:25,786 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,SelfDestructingSolverStorable15 [2022-01-18 12:19:25,787 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 12:19:25,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:19:25,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1506013595, now seen corresponding path program 12 times [2022-01-18 12:19:25,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:19:25,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129603660] [2022-01-18 12:19:25,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:19:25,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:19:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:19:25,916 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 12:19:25,916 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:19:25,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129603660] [2022-01-18 12:19:25,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129603660] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:19:25,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653470149] [2022-01-18 12:19:25,917 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-18 12:19:25,917 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:19:25,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:19:25,920 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-01-18 12:19:25,951 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-01-18 12:19:26,091 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-01-18 12:19:26,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:19:26,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-18 12:19:26,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:19:26,350 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-18 12:19:26,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:19:26,537 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-18 12:19:26,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653470149] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:19:26,537 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:19:26,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 19 [2022-01-18 12:19:26,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335799188] [2022-01-18 12:19:26,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:19:26,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-18 12:19:26,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:19:26,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-18 12:19:26,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-01-18 12:19:26,539 INFO L87 Difference]: Start difference. First operand 34779 states and 144766 transitions. Second operand has 19 states, 19 states have (on average 13.894736842105264) internal successors, (264), 19 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:19:27,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:19:27,777 INFO L93 Difference]: Finished difference Result 59610 states and 250107 transitions. [2022-01-18 12:19:27,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-18 12:19:27,777 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 13.894736842105264) internal successors, (264), 19 states have internal predecessors, (264), 0 states have call successors, (0), 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 160 [2022-01-18 12:19:27,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:19:28,008 INFO L225 Difference]: With dead ends: 59610 [2022-01-18 12:19:28,008 INFO L226 Difference]: Without dead ends: 59610 [2022-01-18 12:19:28,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 325 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=384, Invalid=1176, Unknown=0, NotChecked=0, Total=1560 [2022-01-18 12:19:28,008 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 939 mSDsluCounter, 1873 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 1927 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-18 12:19:28,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [939 Valid, 1927 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-18 12:19:28,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59610 states. [2022-01-18 12:19:29,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59610 to 49659. [2022-01-18 12:19:29,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49659 states, 49658 states have (on average 4.2040758790124455) internal successors, (208766), 49658 states have internal predecessors, (208766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:19:29,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49659 states to 49659 states and 208766 transitions. [2022-01-18 12:19:29,550 INFO L78 Accepts]: Start accepts. Automaton has 49659 states and 208766 transitions. Word has length 160 [2022-01-18 12:19:29,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:19:29,551 INFO L470 AbstractCegarLoop]: Abstraction has 49659 states and 208766 transitions. [2022-01-18 12:19:29,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 13.894736842105264) internal successors, (264), 19 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:19:29,551 INFO L276 IsEmpty]: Start isEmpty. Operand 49659 states and 208766 transitions. [2022-01-18 12:19:29,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-18 12:19:29,674 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:19:29,674 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 12:19:29,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-01-18 12:19:29,875 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,SelfDestructingSolverStorable16 [2022-01-18 12:19:29,875 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 12:19:29,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:19:29,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1462933140, now seen corresponding path program 13 times [2022-01-18 12:19:29,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:19:29,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557135327] [2022-01-18 12:19:29,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:19:29,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:19:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:19:30,244 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-18 12:19:30,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:19:30,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557135327] [2022-01-18 12:19:30,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557135327] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:19:30,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764545334] [2022-01-18 12:19:30,245 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-18 12:19:30,245 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:19:30,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:19:30,247 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-01-18 12:19:30,247 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-01-18 12:19:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:19:30,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 53 conjunts are in the unsatisfiable core [2022-01-18 12:19:30,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:19:30,410 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-01-18 12:19:30,443 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-18 12:19:30,443 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-01-18 12:19:30,481 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-18 12:19:30,481 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-01-18 12:19:30,772 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-01-18 12:19:30,772 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 30 [2022-01-18 12:19:31,316 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 34 treesize of output 32 [2022-01-18 12:19:31,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:19:31,393 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 34 treesize of output 32 [2022-01-18 12:19:31,484 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 12:19:31,500 INFO L353 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2022-01-18 12:19:31,500 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 65 [2022-01-18 12:19:31,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:19:31,623 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 25 treesize of output 24 [2022-01-18 12:19:31,650 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-01-18 12:19:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-18 12:19:31,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:19:34,370 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_55| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_55|)) (forall ((v_ArrVal_748 Int)) (let ((.cse0 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1))))))) is different from false [2022-01-18 12:19:42,357 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (|v_thread3Thread1of1ForFork3_~i~2#1_55| Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_744) c_~A~0.base))) (let ((.cse0 (select (store (store .cse1 c_~A~0.offset v_ArrVal_746) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse0) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_746 1))) (<= c_~min~0 (+ .cse0 1)) (< |v_thread3Thread1of1ForFork3_~i~2#1_55| 1))))) is different from false [2022-01-18 12:19:42,560 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (|v_thread3Thread1of1ForFork3_~i~2#1_55| Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_744) c_~A~0.base))) (let ((.cse0 (select (store (store .cse1 c_~A~0.offset v_ArrVal_746) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse0) (< |v_thread3Thread1of1ForFork3_~i~2#1_55| 1) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_746 1))) (<= c_~min~0 (+ .cse0 1)))))) is different from false [2022-01-18 12:19:43,567 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (|v_thread3Thread1of1ForFork3_~i~2#1_55| Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int)) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_744) c_~A~0.base))) (let ((.cse0 (select (store (store .cse2 c_~A~0.offset v_ArrVal_746) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse0) (and (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse1) (<= .cse1 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_744) c_~A~0.base) c_~A~0.offset v_ArrVal_746) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset) 1))))) (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))))) (<= c_~min~0 (+ .cse0 1)))) (< |v_thread3Thread1of1ForFork3_~i~2#1_55| 1) (not (<= (select .cse2 c_~A~0.offset) (+ v_ArrVal_746 1))))))) is different from false [2022-01-18 12:19:49,148 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (|v_thread3Thread1of1ForFork3_~i~2#1_55| Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int)) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_744) c_~A~0.base))) (let ((.cse0 (select (store (store .cse8 c_~A~0.offset v_ArrVal_746) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse0) (let ((.cse6 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (let ((.cse2 (+ .cse0 1)) (.cse3 (< c_~min~0 .cse6))) (and (or (and (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse1) (<= .cse1 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_744) c_~A~0.base) c_~A~0.offset v_ArrVal_746) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset) 1))))) (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))))) (<= c_~min~0 .cse2))) (not .cse3)) (or (and (forall ((v_subst_2 Int)) (let ((.cse4 (select |c_#memory_int| c_~A~0.base))) (let ((.cse5 (select .cse4 (+ c_~A~0.offset (* 4 v_subst_2))))) (or (< (select .cse4 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))) .cse5) (<= .cse5 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_744) c_~A~0.base) c_~A~0.offset v_ArrVal_746) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset) 1)))))) (or (<= .cse6 .cse2) (forall ((v_subst_1 Int)) (not (let ((.cse7 (select |c_#memory_int| c_~A~0.base))) (< (select .cse7 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))) (select .cse7 (+ c_~A~0.offset (* 4 v_subst_1))))))))) .cse3)))) (< |v_thread3Thread1of1ForFork3_~i~2#1_55| 1) (not (<= (select .cse8 c_~A~0.offset) (+ v_ArrVal_746 1))))))) is different from false [2022-01-18 12:19:52,570 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (|v_thread3Thread1of1ForFork3_~i~2#1_55| Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int)) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_744) c_~A~0.base))) (let ((.cse0 (select (store (store .cse8 c_~A~0.offset v_ArrVal_746) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse0) (let ((.cse4 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse2 (+ .cse0 1)) (.cse3 (< c_~min~0 .cse4))) (and (or (and (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse1) (<= .cse1 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_744) c_~A~0.base) c_~A~0.offset v_ArrVal_746) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset) 1))))) (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))))) (<= c_~min~0 .cse2))) (not .cse3)) (or (and (or (<= .cse4 .cse2) (forall ((v_subst_1 Int)) (not (let ((.cse5 (select |c_#memory_int| c_~A~0.base))) (< (select .cse5 c_~A~0.offset) (select .cse5 (+ c_~A~0.offset (* 4 v_subst_1)))))))) (forall ((v_subst_2 Int)) (let ((.cse7 (select |c_#memory_int| c_~A~0.base))) (let ((.cse6 (select .cse7 (+ c_~A~0.offset (* 4 v_subst_2))))) (or (<= .cse6 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_744) c_~A~0.base) c_~A~0.offset v_ArrVal_746) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset) 1)) (< (select .cse7 c_~A~0.offset) .cse6)))))) .cse3)))) (< |v_thread3Thread1of1ForFork3_~i~2#1_55| 1) (not (<= (select .cse8 c_~A~0.offset) (+ v_ArrVal_746 1))))))) is different from false [2022-01-18 12:19:56,264 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 880 treesize of output 824 [2022-01-18 12:19:56,274 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 980 treesize of output 972 [2022-01-18 12:19:56,282 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 1050 treesize of output 1046 [2022-01-18 12:19:56,306 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:19:56,307 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 1124 treesize of output 1016 [2022-01-18 12:19:57,617 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 8 not checked. [2022-01-18 12:19:57,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764545334] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:19:57,617 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:19:57,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25, 24] total 56 [2022-01-18 12:19:57,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698799872] [2022-01-18 12:19:57,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:19:57,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-01-18 12:19:57,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:19:57,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-01-18 12:19:57,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=2230, Unknown=19, NotChecked=606, Total=3080 [2022-01-18 12:19:57,619 INFO L87 Difference]: Start difference. First operand 49659 states and 208766 transitions. Second operand has 56 states, 56 states have (on average 6.642857142857143) internal successors, (372), 56 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-01-18 12:20:00,982 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~A~0.base))) (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 1)) (.cse2 (select .cse0 c_~A~0.offset)) (.cse3 (+ |c_#StackHeapBarrier| 1))) (and (<= c_~min~0 (+ (select .cse0 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|))) 1)) .cse1 (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (<= c_~min~0 (+ .cse2 1)) (< (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (< (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (exists ((|ULTIMATE.start_main_~#t4~0#1.base| Int)) (= 1 (select |c_#valid| |ULTIMATE.start_main_~#t4~0#1.base|))) (or .cse1 (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (<= .cse2 c_~min~0) (< (+ c_~A~0.base 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 |c_thread3Thread1of1ForFork3_#t~post11#1|) (= c_~A~0.offset 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base|) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_55| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_55|)) (forall ((v_ArrVal_748 Int)) (let ((.cse4 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse4) (<= c_~min~0 (+ .cse4 1)))))))))) is different from false [2022-01-18 12:20:03,189 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~A~0.base))) (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 1)) (.cse2 (select .cse0 c_~A~0.offset)) (.cse3 (+ |c_#StackHeapBarrier| 1))) (and (<= c_~min~0 (+ (select .cse0 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|))) 1)) .cse1 (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (<= c_~min~0 (+ .cse2 1)) (< (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (< (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (exists ((|ULTIMATE.start_main_~#t4~0#1.base| Int)) (= 1 (select |c_#valid| |ULTIMATE.start_main_~#t4~0#1.base|))) (or .cse1 (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (<= .cse2 c_~min~0) (< (+ c_~A~0.base 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 |c_thread3Thread1of1ForFork3_#t~post11#1|) (= c_thread1Thread1of1ForFork0_~i~0 0) (= c_~A~0.offset 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base|) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_55| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_55|)) (forall ((v_ArrVal_748 Int)) (let ((.cse4 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse4) (<= c_~min~0 (+ .cse4 1)))))))))) is different from false [2022-01-18 12:20:05,318 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 1)) (.cse1 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse2 (+ |c_#StackHeapBarrier| 1))) (and .cse0 (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (<= c_~min~0 (+ .cse1 1)) (< (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (< (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (exists ((|ULTIMATE.start_main_~#t4~0#1.base| Int)) (= 1 (select |c_#valid| |ULTIMATE.start_main_~#t4~0#1.base|))) (or .cse0 (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (<= .cse1 c_~min~0) (< (+ c_~A~0.base 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 |c_thread3Thread1of1ForFork3_#t~post11#1|) (= c_thread1Thread1of1ForFork0_~i~0 0) (= c_~A~0.offset 0) (= .cse1 c_~min~0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0) (exists ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse3 (select |c_#memory_int| c_~A~0.base))) (let ((.cse4 (select .cse3 (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (and (not (< (select .cse3 c_~A~0.offset) .cse4)) (= .cse4 c_~min~0))))) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base|) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_55| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_55|)) (forall ((v_ArrVal_748 Int)) (let ((.cse5 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse5) (<= c_~min~0 (+ .cse5 1))))))))) is different from false [2022-01-18 12:20:05,827 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_55| Int) (v_ArrVal_748 Int)) (let ((.cse0 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse0) (< |v_thread3Thread1of1ForFork3_~i~2#1_55| (+ |c_thread3Thread1of1ForFork3_~i~2#1| 1)) (<= c_~min~0 (+ .cse0 1))))) (<= c_~min~0 (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) 1)) (= c_~A~0.offset 0)) is different from false [2022-01-18 12:20:08,057 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 1)) (.cse1 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse2 (+ |c_#StackHeapBarrier| 1))) (and .cse0 (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (<= c_~min~0 (+ .cse1 1)) (< (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (< (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (exists ((|ULTIMATE.start_main_~#t4~0#1.base| Int)) (= 1 (select |c_#valid| |ULTIMATE.start_main_~#t4~0#1.base|))) (or .cse0 (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (< (+ c_~A~0.base 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 |c_thread3Thread1of1ForFork3_#t~post11#1|) (= c_~A~0.offset 0) (= .cse1 c_~min~0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0) (exists ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse3 (select |c_#memory_int| c_~A~0.base))) (let ((.cse4 (select .cse3 (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (and (not (< (select .cse3 c_~A~0.offset) .cse4)) (= .cse4 c_~min~0))))) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base|) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_55| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_55|)) (forall ((v_ArrVal_748 Int)) (let ((.cse5 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse5) (<= c_~min~0 (+ .cse5 1))))))))) is different from false [2022-01-18 12:20:10,442 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~A~0.base)) (.cse1 (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 1)) (.cse2 (+ |c_#StackHeapBarrier| 1))) (and (<= c_~min~0 (+ (select .cse0 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|))) 1)) .cse1 (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (<= c_~min~0 (+ (select .cse0 c_~A~0.offset) 1)) (< (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (< (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (exists ((|ULTIMATE.start_main_~#t4~0#1.base| Int)) (= 1 (select |c_#valid| |ULTIMATE.start_main_~#t4~0#1.base|))) (or .cse1 (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (< (+ c_~A~0.base 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 |c_thread3Thread1of1ForFork3_#t~post11#1|) (= c_~A~0.offset 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base|) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_55| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_55|)) (forall ((v_ArrVal_748 Int)) (let ((.cse3 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse3) (<= c_~min~0 (+ .cse3 1))))))))) is different from false [2022-01-18 12:20:12,447 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 1)) (.cse1 (+ |c_#StackHeapBarrier| 1))) (and .cse0 (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (<= c_~min~0 (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) 1)) (< (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (< (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (exists ((|ULTIMATE.start_main_~#t4~0#1.base| Int)) (= 1 (select |c_#valid| |ULTIMATE.start_main_~#t4~0#1.base|))) (or .cse0 (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (< (+ c_~A~0.base 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 |c_thread3Thread1of1ForFork3_#t~post11#1|) (= c_~A~0.offset 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0) (exists ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse2 (select |c_#memory_int| c_~A~0.base))) (let ((.cse3 (select .cse2 (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (and (not (< (select .cse2 c_~A~0.offset) .cse3)) (= .cse3 c_~min~0))))) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base|) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_55| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_55|)) (forall ((v_ArrVal_748 Int)) (let ((.cse4 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse4) (<= c_~min~0 (+ .cse4 1))))))))) is different from false [2022-01-18 12:20:14,834 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~A~0.base))) (and (<= c_~min~0 (+ (select .cse0 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|))) 1)) (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (<= c_~min~0 (+ (select .cse0 c_~A~0.offset) 1)) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_55| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_55|)) (forall ((v_ArrVal_748 Int)) (let ((.cse1 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse1) (<= c_~min~0 (+ .cse1 1))))))))) is different from false [2022-01-18 12:20:16,840 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~A~0.base))) (and (<= c_~min~0 (+ (select .cse0 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|))) 1)) (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (<= c_~min~0 (+ (select .cse0 c_~A~0.offset) 1)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base)) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_55| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_55|)) (forall ((v_ArrVal_748 Int)) (let ((.cse1 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_55| 4)) v_ArrVal_748) c_~A~0.offset))) (or (<= 2147483647 .cse1) (<= c_~min~0 (+ .cse1 1))))))))) is different from false [2022-01-18 12:20:22,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:20:22,740 INFO L93 Difference]: Finished difference Result 521734 states and 2232409 transitions. [2022-01-18 12:20:22,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-01-18 12:20:22,740 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 6.642857142857143) internal successors, (372), 56 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) Word has length 165 [2022-01-18 12:20:22,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:20:26,655 INFO L225 Difference]: With dead ends: 521734 [2022-01-18 12:20:26,655 INFO L226 Difference]: Without dead ends: 452620 [2022-01-18 12:20:26,666 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 307 SyntacticMatches, 23 SemanticMatches, 101 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 2522 ImplicationChecksByTransitivity, 29.2s TimeCoverageRelationStatistics Valid=1050, Invalid=6638, Unknown=28, NotChecked=2790, Total=10506 [2022-01-18 12:20:26,667 INFO L933 BasicCegarLoop]: 369 mSDtfsCounter, 3417 mSDsluCounter, 9491 mSDsCounter, 0 mSdLazyCounter, 2652 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3417 SdHoareTripleChecker+Valid, 8809 SdHoareTripleChecker+Invalid, 8324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 2652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5482 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-18 12:20:26,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3417 Valid, 8809 Invalid, 8324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 2652 Invalid, 0 Unknown, 5482 Unchecked, 1.1s Time] [2022-01-18 12:20:27,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452620 states. [2022-01-18 12:20:33,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452620 to 60579. [2022-01-18 12:20:33,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60579 states, 60578 states have (on average 4.086566080095084) internal successors, (247556), 60578 states have internal predecessors, (247556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:20:33,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60579 states to 60579 states and 247556 transitions. [2022-01-18 12:20:33,583 INFO L78 Accepts]: Start accepts. Automaton has 60579 states and 247556 transitions. Word has length 165 [2022-01-18 12:20:33,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:20:33,583 INFO L470 AbstractCegarLoop]: Abstraction has 60579 states and 247556 transitions. [2022-01-18 12:20:33,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 6.642857142857143) internal successors, (372), 56 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-01-18 12:20:33,583 INFO L276 IsEmpty]: Start isEmpty. Operand 60579 states and 247556 transitions. [2022-01-18 12:20:33,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-18 12:20:33,716 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:20:33,716 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 12:20:33,732 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-01-18 12:20:33,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:20:33,917 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 12:20:33,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:20:33,918 INFO L85 PathProgramCache]: Analyzing trace with hash -494346104, now seen corresponding path program 14 times [2022-01-18 12:20:33,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:20:33,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971629201] [2022-01-18 12:20:33,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:20:33,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:20:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:20:34,279 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-18 12:20:34,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:20:34,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971629201] [2022-01-18 12:20:34,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971629201] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:20:34,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528002385] [2022-01-18 12:20:34,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 12:20:34,280 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:20:34,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:20:34,281 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-01-18 12:20:34,282 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-01-18 12:20:34,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 12:20:34,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:20:34,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 54 conjunts are in the unsatisfiable core [2022-01-18 12:20:34,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:20:34,462 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-01-18 12:20:34,488 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-18 12:20:34,489 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-01-18 12:20:34,533 INFO L353 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-01-18 12:20:34,534 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-01-18 12:20:34,638 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-01-18 12:20:34,638 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 16 treesize of output 18 [2022-01-18 12:20:35,780 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-01-18 12:20:35,877 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 34 treesize of output 32 [2022-01-18 12:20:35,966 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 12:20:35,983 INFO L353 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2022-01-18 12:20:35,983 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 65 [2022-01-18 12:20:36,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:20:36,087 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 25 treesize of output 24 [2022-01-18 12:20:36,115 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-01-18 12:20:36,202 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-18 12:20:36,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:20:40,458 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_59| Int)) (or (forall ((v_ArrVal_808 Int)) (let ((.cse0 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_808) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1))))) (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_59|)))) is different from false [2022-01-18 12:20:50,159 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_808 Int) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_806 Int) (|v_thread3Thread1of1ForFork3_~i~2#1_59| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_805) c_~A~0.base))) (let ((.cse0 (select (store (store .cse1 c_~A~0.offset v_ArrVal_806) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_808) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0) (< |v_thread3Thread1of1ForFork3_~i~2#1_59| 1) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_806 1))))))) is different from false [2022-01-18 12:20:50,386 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_808 Int) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_806 Int) (|v_thread3Thread1of1ForFork3_~i~2#1_59| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_804) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_805) c_~A~0.base))) (let ((.cse1 (select (store (store .cse0 c_~A~0.offset v_ArrVal_806) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_808) c_~A~0.offset))) (or (not (<= (select .cse0 c_~A~0.offset) (+ v_ArrVal_806 1))) (<= 2147483647 .cse1) (<= c_~min~0 (+ .cse1 1)) (< |v_thread3Thread1of1ForFork3_~i~2#1_59| 1))))) is different from false [2022-01-18 12:20:51,408 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_808 Int) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_806 Int) (|v_thread3Thread1of1ForFork3_~i~2#1_59| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_804) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_805) c_~A~0.base))) (let ((.cse1 (select (store (store .cse0 c_~A~0.offset v_ArrVal_806) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_808) c_~A~0.offset))) (or (not (<= (select .cse0 c_~A~0.offset) (+ v_ArrVal_806 1))) (<= 2147483647 .cse1) (and (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse2) (<= .cse2 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_804) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_805) c_~A~0.base) c_~A~0.offset v_ArrVal_806) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_808) c_~A~0.offset) 1))))) (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))))) (<= c_~min~0 (+ .cse1 1)))) (< |v_thread3Thread1of1ForFork3_~i~2#1_59| 1))))) is different from false [2022-01-18 12:20:56,075 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_808 Int) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_806 Int) (|v_thread3Thread1of1ForFork3_~i~2#1_59| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_804) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_805) c_~A~0.base))) (let ((.cse1 (select (store (store .cse0 c_~A~0.offset v_ArrVal_806) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_808) c_~A~0.offset))) (or (not (<= (select .cse0 c_~A~0.offset) (+ v_ArrVal_806 1))) (<= 2147483647 .cse1) (< |v_thread3Thread1of1ForFork3_~i~2#1_59| 1) (let ((.cse5 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (let ((.cse2 (< c_~min~0 .cse5)) (.cse6 (+ .cse1 1))) (and (or .cse2 (and (forall ((v_subst_4 Int)) (let ((.cse4 (select |c_#memory_int| c_~A~0.base))) (let ((.cse3 (select .cse4 (+ c_~A~0.offset (* 4 v_subst_4))))) (or (<= .cse3 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_804) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_805) c_~A~0.base) c_~A~0.offset v_ArrVal_806) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_808) c_~A~0.offset) 1)) (< (select .cse4 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))) .cse3))))) (or (<= .cse5 .cse6) (forall ((v_subst_3 Int)) (not (let ((.cse7 (select |c_#memory_int| c_~A~0.base))) (< (select .cse7 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))) (select .cse7 (+ c_~A~0.offset (* 4 v_subst_3)))))))))) (or (not .cse2) (and (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse8 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse8) (<= .cse8 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_804) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_805) c_~A~0.base) c_~A~0.offset v_ArrVal_806) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_808) c_~A~0.offset) 1))))) (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))))) (<= c_~min~0 .cse6))))))))))) is different from false [2022-01-18 12:21:00,352 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_808 Int) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_806 Int) (|v_thread3Thread1of1ForFork3_~i~2#1_59| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_804) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_805) c_~A~0.base))) (let ((.cse1 (select (store (store .cse0 c_~A~0.offset v_ArrVal_806) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_808) c_~A~0.offset))) (or (not (<= (select .cse0 c_~A~0.offset) (+ v_ArrVal_806 1))) (<= 2147483647 .cse1) (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse4 (+ .cse1 1)) (.cse7 (< c_~min~0 .cse3))) (and (or (and (or (forall ((v_subst_3 Int)) (not (let ((.cse2 (select |c_#memory_int| c_~A~0.base))) (< (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset (* 4 v_subst_3))))))) (<= .cse3 .cse4)) (forall ((v_subst_4 Int)) (let ((.cse5 (select |c_#memory_int| c_~A~0.base))) (let ((.cse6 (select .cse5 (+ c_~A~0.offset (* 4 v_subst_4))))) (or (< (select .cse5 c_~A~0.offset) .cse6) (<= .cse6 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_804) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_805) c_~A~0.base) c_~A~0.offset v_ArrVal_806) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_808) c_~A~0.offset) 1))))))) .cse7) (or (and (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse8 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse8) (<= .cse8 (+ (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_804) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_805) c_~A~0.base) c_~A~0.offset v_ArrVal_806) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_808) c_~A~0.offset) 1))))) (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))))) (<= c_~min~0 .cse4))) (not .cse7))))) (< |v_thread3Thread1of1ForFork3_~i~2#1_59| 1))))) is different from false [2022-01-18 12:21:05,420 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 436 treesize of output 404 [2022-01-18 12:21:05,423 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 482 treesize of output 478 [2022-01-18 12:21:05,426 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 517 treesize of output 515 [2022-01-18 12:21:05,440 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:21:05,441 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 554 treesize of output 512 [2022-01-18 12:21:05,939 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 8 not checked. [2022-01-18 12:21:05,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528002385] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:21:05,940 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:21:05,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 24] total 54 [2022-01-18 12:21:05,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996914130] [2022-01-18 12:21:05,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:21:05,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-01-18 12:21:05,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:21:05,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-01-18 12:21:05,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=2029, Unknown=22, NotChecked=582, Total=2862 [2022-01-18 12:21:05,942 INFO L87 Difference]: Start difference. First operand 60579 states and 247556 transitions. Second operand has 54 states, 54 states have (on average 6.907407407407407) internal successors, (373), 54 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:21:08,806 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_#StackHeapBarrier| 1))) (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (<= c_~min~0 (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) 1)) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_59| Int)) (or (forall ((v_ArrVal_808 Int)) (let ((.cse0 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_808) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1))))) (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_59|)))) (<= 0 |c_thread3Thread1of1ForFork3_#t~post11#1|) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~A~0.offset 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base|))) is different from false [2022-01-18 12:21:10,812 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~A~0.base)) (.cse2 (+ |c_#StackHeapBarrier| 1))) (and (<= c_~min~0 (+ (select .cse0 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|))) 1)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (<= c_~min~0 (+ (select .cse0 c_~A~0.offset) 1)) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_59| Int)) (or (forall ((v_ArrVal_808 Int)) (let ((.cse1 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_808) c_~A~0.offset))) (or (<= 2147483647 .cse1) (<= c_~min~0 (+ .cse1 1))))) (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_59|)))) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base|))) is different from false [2022-01-18 12:21:12,884 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~A~0.base))) (and (<= c_~min~0 (+ (select .cse0 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|))) 1)) (= |c_thread3Thread1of1ForFork3_~i~2#1| 0) (<= c_~min~0 (+ (select .cse0 c_~A~0.offset) 1)) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_59| Int)) (or (forall ((v_ArrVal_808 Int)) (let ((.cse1 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_808) c_~A~0.offset))) (or (<= 2147483647 .cse1) (<= c_~min~0 (+ .cse1 1))))) (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_59|)))) (= |c_thread3Thread1of1ForFork3_#t~post11#1| 0))) is different from false [2022-01-18 12:21:14,920 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_~min~0 (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) 1)) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_59| Int)) (or (forall ((v_ArrVal_808 Int)) (let ((.cse0 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_808) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1))))) (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_59|)))) (<= 1 |c_thread3Thread1of1ForFork3_~i~2#1|) (<= 0 |c_thread3Thread1of1ForFork3_#t~post11#1|) (= c_~A~0.offset 0)) is different from false [2022-01-18 12:21:17,029 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_~min~0 (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) 1)) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_59| Int)) (or (forall ((v_ArrVal_808 Int)) (let ((.cse0 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_808) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1))))) (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_59|)))) (<= 1 |c_thread3Thread1of1ForFork3_~i~2#1|) (<= 0 |c_thread3Thread1of1ForFork3_#t~post11#1|) (= c_~A~0.offset 0) (<= c_~min~0 (+ c_~max~0 1))) is different from false [2022-01-18 12:21:17,502 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (<= c_~min~0 (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) 1)) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (forall ((v_ArrVal_808 Int) (|v_thread3Thread1of1ForFork3_~i~2#1_59| Int)) (let ((.cse1 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_808) c_~A~0.offset))) (or (< |v_thread3Thread1of1ForFork3_~i~2#1_59| (+ |c_thread3Thread1of1ForFork3_~i~2#1| 1)) (<= 2147483647 .cse1) (<= c_~min~0 (+ .cse1 1))))) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|))) is different from false [2022-01-18 12:21:19,539 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_~min~0 (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) 1)) (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_59| Int)) (or (forall ((v_ArrVal_808 Int)) (let ((.cse0 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_59| 4)) v_ArrVal_808) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1))))) (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_59|))))) is different from false [2022-01-18 12:21:21,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:21:21,788 INFO L93 Difference]: Finished difference Result 268466 states and 1095200 transitions. [2022-01-18 12:21:21,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-01-18 12:21:21,788 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 6.907407407407407) internal successors, (373), 54 states have internal predecessors, (373), 0 states have call successors, (0), 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 165 [2022-01-18 12:21:21,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:21:23,104 INFO L225 Difference]: With dead ends: 268466 [2022-01-18 12:21:23,104 INFO L226 Difference]: Without dead ends: 139406 [2022-01-18 12:21:23,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 318 SyntacticMatches, 6 SemanticMatches, 94 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 2017 ImplicationChecksByTransitivity, 28.3s TimeCoverageRelationStatistics Valid=724, Invalid=6105, Unknown=29, NotChecked=2262, Total=9120 [2022-01-18 12:21:23,105 INFO L933 BasicCegarLoop]: 307 mSDtfsCounter, 1705 mSDsluCounter, 6859 mSDsCounter, 0 mSdLazyCounter, 1879 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1705 SdHoareTripleChecker+Valid, 6482 SdHoareTripleChecker+Invalid, 8190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6228 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-18 12:21:23,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1705 Valid, 6482 Invalid, 8190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1879 Invalid, 0 Unknown, 6228 Unchecked, 0.7s Time] [2022-01-18 12:21:23,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139406 states. [2022-01-18 12:21:25,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139406 to 73550. [2022-01-18 12:21:25,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73550 states, 73549 states have (on average 3.9518552257678556) internal successors, (290655), 73549 states have internal predecessors, (290655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:21:26,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73550 states to 73550 states and 290655 transitions. [2022-01-18 12:21:26,270 INFO L78 Accepts]: Start accepts. Automaton has 73550 states and 290655 transitions. Word has length 165 [2022-01-18 12:21:26,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:21:26,270 INFO L470 AbstractCegarLoop]: Abstraction has 73550 states and 290655 transitions. [2022-01-18 12:21:26,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 6.907407407407407) internal successors, (373), 54 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:21:26,270 INFO L276 IsEmpty]: Start isEmpty. Operand 73550 states and 290655 transitions. [2022-01-18 12:21:26,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-18 12:21:26,482 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:21:26,482 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 12:21:26,498 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-01-18 12:21:26,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:21:26,683 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 12:21:26,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:21:26,683 INFO L85 PathProgramCache]: Analyzing trace with hash -188282076, now seen corresponding path program 15 times [2022-01-18 12:21:26,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:21:26,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108175475] [2022-01-18 12:21:26,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:21:26,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:21:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:21:27,082 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-18 12:21:27,082 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:21:27,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108175475] [2022-01-18 12:21:27,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108175475] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:21:27,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220264006] [2022-01-18 12:21:27,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 12:21:27,083 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:21:27,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:21:27,084 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-01-18 12:21:27,087 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-01-18 12:21:27,293 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-18 12:21:27,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:21:27,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 44 conjunts are in the unsatisfiable core [2022-01-18 12:21:27,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:21:28,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:21:28,141 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 34 treesize of output 32 [2022-01-18 12:21:28,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:21:28,235 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 34 treesize of output 32 [2022-01-18 12:21:28,330 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 12:21:28,345 INFO L353 Elim1Store]: treesize reduction 32, result has 50.0 percent of original size [2022-01-18 12:21:28,345 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 55 [2022-01-18 12:21:28,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:21:28,479 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 25 treesize of output 24 [2022-01-18 12:21:28,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:21:28,565 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 16 treesize of output 18 [2022-01-18 12:21:28,594 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-01-18 12:21:28,666 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-18 12:21:28,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:21:28,816 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_868 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_868) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1))))) is different from false [2022-01-18 12:21:28,868 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse0 (select (select (store (store |c_#memory_int| c_~A~0.base (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|)) v_ArrVal_867)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_868) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0)))) is different from false [2022-01-18 12:21:28,891 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_63| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_63|)) (forall ((v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse0 (select (select (store (store |c_#memory_int| c_~A~0.base (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_63| 4)) v_ArrVal_867)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_868) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1))))))) is different from false [2022-01-18 12:21:28,905 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_63| Int) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int)) (let ((.cse0 (select (select (store (store |c_#memory_int| c_~A~0.base (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_63| 4)) v_ArrVal_867)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_868) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1)) (< |v_thread3Thread1of1ForFork3_~i~2#1_63| (+ |c_thread3Thread1of1ForFork3_~i~2#1| 1))))) is different from false [2022-01-18 12:21:28,956 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_63| Int) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int) (v_ArrVal_865 Int)) (let ((.cse1 (select |c_#memory_int| c_~A~0.base)) (.cse2 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|)))) (let ((.cse0 (select (select (store (store |c_#memory_int| c_~A~0.base (store (store .cse1 .cse2 v_ArrVal_865) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_63| 4)) v_ArrVal_867)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_868) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0) (not (<= (select .cse1 .cse2) (+ v_ArrVal_865 1))) (< |v_thread3Thread1of1ForFork3_~i~2#1_63| (+ |c_thread3Thread1of1ForFork3_~i~2#1| 1)))))) is different from false [2022-01-18 12:21:29,029 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_63| Int) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int) (v_ArrVal_865 Int)) (let ((.cse1 (select |c_#memory_int| c_~A~0.base))) (let ((.cse0 (select (select (store (store |c_#memory_int| c_~A~0.base (store (store .cse1 c_~A~0.offset v_ArrVal_865) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_63| 4)) v_ArrVal_867)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_868) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_865 1))) (< |v_thread3Thread1of1ForFork3_~i~2#1_63| 1))))) is different from false [2022-01-18 12:21:29,100 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_63| Int) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int) (v_ArrVal_863 (Array Int Int)) (v_ArrVal_865 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_863))) (let ((.cse0 (select .cse2 c_~A~0.base))) (let ((.cse1 (select (select (store (store .cse2 c_~A~0.base (store (store .cse0 c_~A~0.offset v_ArrVal_865) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_63| 4)) v_ArrVal_867)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_868) c_~A~0.base) c_~A~0.offset))) (or (< |v_thread3Thread1of1ForFork3_~i~2#1_63| 1) (not (<= (select .cse0 c_~A~0.offset) (+ v_ArrVal_865 1))) (<= c_~min~0 (+ .cse1 1)) (<= 2147483647 .cse1)))))) is different from false [2022-01-18 12:21:29,312 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_63| Int) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int) (v_ArrVal_863 (Array Int Int)) (v_ArrVal_865 Int) (v_ArrVal_862 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_862) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_863))) (let ((.cse1 (select .cse2 c_~A~0.base))) (let ((.cse0 (select (select (store (store .cse2 c_~A~0.base (store (store .cse1 c_~A~0.offset v_ArrVal_865) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_63| 4)) v_ArrVal_867)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_868) c_~A~0.base) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (< |v_thread3Thread1of1ForFork3_~i~2#1_63| 1) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_865 1))) (<= 2147483647 .cse0)))))) is different from false [2022-01-18 12:21:30,608 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_63| Int) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int) (v_ArrVal_863 (Array Int Int)) (v_ArrVal_865 Int) (v_ArrVal_862 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_862) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_863))) (let ((.cse0 (select .cse4 c_~A~0.base))) (let ((.cse1 (select (select (store (store .cse4 c_~A~0.base (store (store .cse0 c_~A~0.offset v_ArrVal_865) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_63| 4)) v_ArrVal_867)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_868) c_~A~0.base) c_~A~0.offset))) (or (< |v_thread3Thread1of1ForFork3_~i~2#1_63| 1) (not (<= (select .cse0 c_~A~0.offset) (+ v_ArrVal_865 1))) (<= 2147483647 .cse1) (and (or (<= c_~min~0 (+ .cse1 1)) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))))) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse2) (<= .cse2 (+ (select (select (store (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_862) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_863))) (store .cse3 c_~A~0.base (store (store (select .cse3 c_~A~0.base) c_~A~0.offset v_ArrVal_865) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_63| 4)) v_ArrVal_867))) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_868) c_~A~0.base) c_~A~0.offset) 1))))))))))) is different from false [2022-01-18 12:21:36,517 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_63| Int) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int) (v_ArrVal_863 (Array Int Int)) (v_ArrVal_865 Int) (v_ArrVal_862 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_862) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_863))) (let ((.cse10 (select .cse11 c_~A~0.base))) (let ((.cse9 (select (select (store (store .cse11 c_~A~0.base (store (store .cse10 c_~A~0.offset v_ArrVal_865) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_63| 4)) v_ArrVal_867)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_868) c_~A~0.base) c_~A~0.offset))) (or (< |v_thread3Thread1of1ForFork3_~i~2#1_63| 1) (let ((.cse4 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (let ((.cse0 (< c_~min~0 .cse4)) (.cse1 (+ .cse9 1))) (and (or (not .cse0) (and (or (<= c_~min~0 .cse1) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))))) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse2) (<= .cse2 (+ (select (select (store (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_862) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_863))) (store .cse3 c_~A~0.base (store (store (select .cse3 c_~A~0.base) c_~A~0.offset v_ArrVal_865) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_63| 4)) v_ArrVal_867))) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_868) c_~A~0.base) c_~A~0.offset) 1))))))) (or .cse0 (and (or (<= .cse4 .cse1) (forall ((v_subst_5 Int)) (not (let ((.cse5 (select |c_#memory_int| c_~A~0.base))) (< (select .cse5 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))) (select .cse5 (+ c_~A~0.offset (* 4 v_subst_5)))))))) (forall ((v_subst_6 Int)) (let ((.cse6 (select |c_#memory_int| c_~A~0.base))) (let ((.cse7 (select .cse6 (+ c_~A~0.offset (* 4 v_subst_6))))) (or (< (select .cse6 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))) .cse7) (<= .cse7 (+ (select (select (store (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_862) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_863))) (store .cse8 c_~A~0.base (store (store (select .cse8 c_~A~0.base) c_~A~0.offset v_ArrVal_865) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_63| 4)) v_ArrVal_867))) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_868) c_~A~0.base) c_~A~0.offset) 1))))))))))) (not (<= (select .cse10 c_~A~0.offset) (+ v_ArrVal_865 1))) (<= 2147483647 .cse9)))))) is different from false [2022-01-18 12:21:41,062 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_63| Int) (v_ArrVal_868 (Array Int Int)) (v_ArrVal_867 Int) (v_ArrVal_863 (Array Int Int)) (v_ArrVal_865 Int) (v_ArrVal_862 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_862) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_863))) (let ((.cse10 (select .cse11 c_~A~0.base))) (let ((.cse9 (select (select (store (store .cse11 c_~A~0.base (store (store .cse10 c_~A~0.offset v_ArrVal_865) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_63| 4)) v_ArrVal_867)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_868) c_~A~0.base) c_~A~0.offset))) (or (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse1 (+ .cse9 1)) (.cse6 (< c_~min~0 .cse0))) (and (or (and (or (<= .cse0 .cse1) (forall ((v_subst_5 Int)) (not (let ((.cse2 (select |c_#memory_int| c_~A~0.base))) (< (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset (* 4 v_subst_5)))))))) (forall ((v_subst_6 Int)) (let ((.cse5 (select |c_#memory_int| c_~A~0.base))) (let ((.cse3 (select .cse5 (+ c_~A~0.offset (* 4 v_subst_6))))) (or (<= .cse3 (+ (select (select (store (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_862) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_863))) (store .cse4 c_~A~0.base (store (store (select .cse4 c_~A~0.base) c_~A~0.offset v_ArrVal_865) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_63| 4)) v_ArrVal_867))) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_868) c_~A~0.base) c_~A~0.offset) 1)) (< (select .cse5 c_~A~0.offset) .cse3)))))) .cse6) (or (and (or (<= c_~min~0 .cse1) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))))) (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse7 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse7) (<= .cse7 (+ (select (select (store (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_862) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_863))) (store .cse8 c_~A~0.base (store (store (select .cse8 c_~A~0.base) c_~A~0.offset v_ArrVal_865) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_63| 4)) v_ArrVal_867))) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_868) c_~A~0.base) c_~A~0.offset) 1)))))) (not .cse6))))) (< |v_thread3Thread1of1ForFork3_~i~2#1_63| 1) (not (<= (select .cse10 c_~A~0.offset) (+ v_ArrVal_865 1))) (<= 2147483647 .cse9)))))) is different from false [2022-01-18 12:21:44,955 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 680 treesize of output 632 [2022-01-18 12:21:44,959 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 671 treesize of output 669 [2022-01-18 12:21:44,964 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 747 treesize of output 743 [2022-01-18 12:21:44,981 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:21:44,982 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 782 treesize of output 708 [2022-01-18 12:21:44,987 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 708 treesize of output 684 [2022-01-18 12:21:52,287 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 14 not checked. [2022-01-18 12:21:52,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220264006] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 12:21:52,287 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 12:21:52,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 26] total 61 [2022-01-18 12:21:52,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796564037] [2022-01-18 12:21:52,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 12:21:52,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-01-18 12:21:52,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 12:21:52,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-01-18 12:21:52,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=2220, Unknown=11, NotChecked=1166, Total=3660 [2022-01-18 12:21:52,289 INFO L87 Difference]: Start difference. First operand 73550 states and 290655 transitions. Second operand has 61 states, 61 states have (on average 6.065573770491803) internal successors, (370), 61 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-01-18 12:22:00,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 12:22:00,975 INFO L93 Difference]: Finished difference Result 438948 states and 1806655 transitions. [2022-01-18 12:22:00,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-01-18 12:22:00,975 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 6.065573770491803) internal successors, (370), 61 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) Word has length 165 [2022-01-18 12:22:00,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 12:22:02,459 INFO L225 Difference]: With dead ends: 438948 [2022-01-18 12:22:02,460 INFO L226 Difference]: Without dead ends: 154275 [2022-01-18 12:22:02,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 305 SyntacticMatches, 14 SemanticMatches, 138 ConstructedPredicates, 11 IntricatePredicates, 1 DeprecatedPredicates, 5459 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2232, Invalid=14313, Unknown=11, NotChecked=2904, Total=19460 [2022-01-18 12:22:02,468 INFO L933 BasicCegarLoop]: 334 mSDtfsCounter, 3111 mSDsluCounter, 9433 mSDsCounter, 0 mSdLazyCounter, 3792 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3111 SdHoareTripleChecker+Valid, 8721 SdHoareTripleChecker+Invalid, 9980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 3792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5950 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-18 12:22:02,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3111 Valid, 8721 Invalid, 9980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 3792 Invalid, 0 Unknown, 5950 Unchecked, 1.7s Time] [2022-01-18 12:22:02,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154275 states. [2022-01-18 12:22:04,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154275 to 64590. [2022-01-18 12:22:04,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64590 states, 64589 states have (on average 4.024756537490904) internal successors, (259955), 64589 states have internal predecessors, (259955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 12:22:05,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64590 states to 64590 states and 259955 transitions. [2022-01-18 12:22:05,098 INFO L78 Accepts]: Start accepts. Automaton has 64590 states and 259955 transitions. Word has length 165 [2022-01-18 12:22:05,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 12:22:05,099 INFO L470 AbstractCegarLoop]: Abstraction has 64590 states and 259955 transitions. [2022-01-18 12:22:05,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 6.065573770491803) internal successors, (370), 61 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-01-18 12:22:05,099 INFO L276 IsEmpty]: Start isEmpty. Operand 64590 states and 259955 transitions. [2022-01-18 12:22:05,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-18 12:22:05,236 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 12:22:05,236 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 12:22:05,253 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-01-18 12:22:05,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:22:05,439 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-18 12:22:05,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 12:22:05,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1450942164, now seen corresponding path program 16 times [2022-01-18 12:22:05,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 12:22:05,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740825738] [2022-01-18 12:22:05,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 12:22:05,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 12:22:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 12:22:06,554 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-18 12:22:06,554 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 12:22:06,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740825738] [2022-01-18 12:22:06,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740825738] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 12:22:06,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155093605] [2022-01-18 12:22:06,554 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-18 12:22:06,555 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 12:22:06,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 12:22:06,564 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-01-18 12:22:06,565 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-01-18 12:22:06,717 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-18 12:22:06,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 12:22:06,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 56 conjunts are in the unsatisfiable core [2022-01-18 12:22:06,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 12:22:06,781 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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-01-18 12:22:06,816 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-18 12:22:06,816 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-01-18 12:22:07,104 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-18 12:22:07,104 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 15 treesize of output 15 [2022-01-18 12:22:07,273 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-18 12:22:07,472 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-01-18 12:22:07,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:22:07,892 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-01-18 12:22:07,988 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 34 treesize of output 32 [2022-01-18 12:22:08,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:22:08,133 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 34 treesize of output 32 [2022-01-18 12:22:08,184 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-18 12:22:08,201 INFO L353 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2022-01-18 12:22:08,201 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 65 [2022-01-18 12:22:08,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 12:22:08,331 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 25 treesize of output 24 [2022-01-18 12:22:08,363 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-01-18 12:22:08,446 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-18 12:22:08,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 12:22:10,665 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread3Thread1of1ForFork3_~i~2#1_67| Int)) (or (not (<= (+ |c_thread3Thread1of1ForFork3_#t~post11#1| 1) |v_thread3Thread1of1ForFork3_~i~2#1_67|)) (forall ((v_ArrVal_932 Int)) (let ((.cse0 (select (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_67| 4)) v_ArrVal_932) c_~A~0.offset))) (or (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0)))))) is different from false [2022-01-18 12:22:18,143 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_929 Int) (|v_thread3Thread1of1ForFork3_~i~2#1_67| Int) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_932 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_928) c_~A~0.base)) (.cse2 (+ c_~A~0.offset (* 4 |c_thread3Thread1of1ForFork3_~i~2#1|)))) (let ((.cse0 (select (store (store .cse1 .cse2 v_ArrVal_929) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_67| 4)) v_ArrVal_932) c_~A~0.offset))) (or (< |v_thread3Thread1of1ForFork3_~i~2#1_67| (+ |c_thread3Thread1of1ForFork3_~i~2#1| 1)) (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0) (not (<= (select .cse1 .cse2) (+ v_ArrVal_929 1))))))) is different from false [2022-01-18 12:22:18,356 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_929 Int) (|v_thread3Thread1of1ForFork3_~i~2#1_67| Int) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_932 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_928) c_~A~0.base))) (let ((.cse0 (select (store (store .cse1 c_~A~0.offset v_ArrVal_929) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_67| 4)) v_ArrVal_932) c_~A~0.offset))) (or (< |v_thread3Thread1of1ForFork3_~i~2#1_67| 1) (<= c_~min~0 (+ .cse0 1)) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_929 1))) (<= 2147483647 .cse0))))) is different from false [2022-01-18 12:22:18,425 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_929 Int) (|v_thread3Thread1of1ForFork3_~i~2#1_67| Int) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_932 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_927) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_928) c_~A~0.base))) (let ((.cse0 (select (store (store .cse1 c_~A~0.offset v_ArrVal_929) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_67| 4)) v_ArrVal_932) c_~A~0.offset))) (or (< |v_thread3Thread1of1ForFork3_~i~2#1_67| 1) (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1)) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_929 1))))))) is different from false [2022-01-18 12:22:18,689 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_929 Int) (v_ArrVal_926 (Array Int Int)) (|v_thread3Thread1of1ForFork3_~i~2#1_67| Int) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_932 Int)) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_926) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_927) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_928) c_~A~0.base))) (let ((.cse0 (select (store (store .cse1 c_~A~0.offset v_ArrVal_929) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_67| 4)) v_ArrVal_932) c_~A~0.offset))) (or (< |v_thread3Thread1of1ForFork3_~i~2#1_67| 1) (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1)) (not (<= (select .cse1 c_~A~0.offset) (+ v_ArrVal_929 1))))))) is different from false [2022-01-18 12:22:19,885 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_929 Int) (v_ArrVal_926 (Array Int Int)) (|v_thread3Thread1of1ForFork3_~i~2#1_67| Int) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_932 Int)) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_926) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_927) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_928) c_~A~0.base))) (let ((.cse0 (select (store (store .cse2 c_~A~0.offset v_ArrVal_929) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_67| 4)) v_ArrVal_932) c_~A~0.offset))) (or (< |v_thread3Thread1of1ForFork3_~i~2#1_67| 1) (<= 2147483647 .cse0) (and (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse1) (<= .cse1 (+ (select (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_926) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_927) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_928) c_~A~0.base) c_~A~0.offset v_ArrVal_929) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_67| 4)) v_ArrVal_932) c_~A~0.offset) 1))))) (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))))) (<= c_~min~0 (+ .cse0 1)))) (not (<= (select .cse2 c_~A~0.offset) (+ v_ArrVal_929 1))))))) is different from false [2022-01-18 12:22:24,440 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_929 Int) (v_ArrVal_926 (Array Int Int)) (|v_thread3Thread1of1ForFork3_~i~2#1_67| Int) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_932 Int)) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_926) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_927) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_928) c_~A~0.base))) (let ((.cse0 (select (store (store .cse8 c_~A~0.offset v_ArrVal_929) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_67| 4)) v_ArrVal_932) c_~A~0.offset))) (or (< |v_thread3Thread1of1ForFork3_~i~2#1_67| 1) (<= 2147483647 .cse0) (let ((.cse4 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))))) (let ((.cse1 (< c_~min~0 .cse4)) (.cse5 (+ .cse0 1))) (and (or .cse1 (and (forall ((v_subst_8 Int)) (let ((.cse2 (select |c_#memory_int| c_~A~0.base))) (let ((.cse3 (select .cse2 (+ c_~A~0.offset (* 4 v_subst_8))))) (or (< (select .cse2 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))) .cse3) (<= .cse3 (+ (select (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_926) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_927) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_928) c_~A~0.base) c_~A~0.offset v_ArrVal_929) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_67| 4)) v_ArrVal_932) c_~A~0.offset) 1)))))) (or (<= .cse4 .cse5) (forall ((v_subst_7 Int)) (not (let ((.cse6 (select |c_#memory_int| c_~A~0.base))) (< (select .cse6 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))) (select .cse6 (+ c_~A~0.offset (* 4 v_subst_7)))))))))) (or (not .cse1) (and (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse7 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse7) (<= .cse7 (+ (select (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_926) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_927) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_928) c_~A~0.base) c_~A~0.offset v_ArrVal_929) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_67| 4)) v_ArrVal_932) c_~A~0.offset) 1))))) (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))))) (<= c_~min~0 .cse5))))))) (not (<= (select .cse8 c_~A~0.offset) (+ v_ArrVal_929 1))))))) is different from false [2022-01-18 12:22:30,364 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_929 Int) (v_ArrVal_926 (Array Int Int)) (|v_thread3Thread1of1ForFork3_~i~2#1_67| Int) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_932 Int)) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_926) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_927) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_928) c_~A~0.base))) (let ((.cse0 (select (store (store .cse8 c_~A~0.offset v_ArrVal_929) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_67| 4)) v_ArrVal_932) c_~A~0.offset))) (or (< |v_thread3Thread1of1ForFork3_~i~2#1_67| 1) (<= 2147483647 .cse0) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse2 (+ .cse0 1)) (.cse6 (< c_~min~0 .cse1))) (and (or (and (or (<= .cse1 .cse2) (forall ((v_subst_7 Int)) (not (let ((.cse3 (select |c_#memory_int| c_~A~0.base))) (< (select .cse3 c_~A~0.offset) (select .cse3 (+ c_~A~0.offset (* 4 v_subst_7)))))))) (forall ((v_subst_8 Int)) (let ((.cse4 (select |c_#memory_int| c_~A~0.base))) (let ((.cse5 (select .cse4 (+ c_~A~0.offset (* 4 v_subst_8))))) (or (< (select .cse4 c_~A~0.offset) .cse5) (<= .cse5 (+ (select (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_926) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_927) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_928) c_~A~0.base) c_~A~0.offset v_ArrVal_929) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_67| 4)) v_ArrVal_932) c_~A~0.offset) 1))))))) .cse6) (or (and (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (let ((.cse7 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (or (< c_~min~0 .cse7) (<= .cse7 (+ (select (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_926) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_927) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_928) c_~A~0.base) c_~A~0.offset v_ArrVal_929) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_67| 4)) v_ArrVal_932) c_~A~0.offset) 1))))) (or (forall ((thread1Thread1of1ForFork0_~i~0 Int)) (not (< c_~min~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))))) (<= c_~min~0 .cse2))) (not .cse6))))) (not (<= (select .cse8 c_~A~0.offset) (+ v_ArrVal_929 1))))))) is different from false [2022-01-18 12:22:32,987 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_929 Int) (v_ArrVal_926 (Array Int Int)) (|v_thread3Thread1of1ForFork3_~i~2#1_67| Int) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_932 Int)) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_926) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_927) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_928) c_~A~0.base))) (let ((.cse0 (select (store (store .cse4 c_~A~0.offset v_ArrVal_929) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_67| 4)) v_ArrVal_932) c_~A~0.offset))) (or (< |v_thread3Thread1of1ForFork3_~i~2#1_67| 1) (and (or (<= (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (+ .cse0 1)) (forall ((v_subst_7 Int)) (not (let ((.cse1 (select |c_#memory_int| c_~A~0.base))) (< (select .cse1 c_~A~0.offset) (select .cse1 (+ c_~A~0.offset (* 4 v_subst_7)))))))) (forall ((v_subst_8 Int)) (let ((.cse2 (select |c_#memory_int| c_~A~0.base))) (let ((.cse3 (select .cse2 (+ c_~A~0.offset (* 4 v_subst_8))))) (or (< (select .cse2 c_~A~0.offset) .cse3) (<= .cse3 (+ (select (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_926) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_927) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_928) c_~A~0.base) c_~A~0.offset v_ArrVal_929) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_67| 4)) v_ArrVal_932) c_~A~0.offset) 1))))))) (<= 2147483647 .cse0) (not (<= (select .cse4 c_~A~0.offset) (+ v_ArrVal_929 1))))))) is different from false [2022-01-18 12:22:34,270 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_929 Int) (v_ArrVal_926 (Array Int Int)) (v_ArrVal_925 (Array Int Int)) (|v_thread3Thread1of1ForFork3_~i~2#1_67| Int) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_932 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_925))) (let ((.cse0 (select (store (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_926) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_927) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_928) c_~A~0.base))) (let ((.cse3 (select (store (store .cse0 c_~A~0.offset v_ArrVal_929) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_67| 4)) v_ArrVal_932) c_~A~0.offset))) (or (< |v_thread3Thread1of1ForFork3_~i~2#1_67| 1) (not (<= (select .cse0 c_~A~0.offset) (+ v_ArrVal_929 1))) (and (or (forall ((v_subst_7 Int)) (not (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_925) c_~A~0.base))) (< (select .cse1 c_~A~0.offset) (select .cse1 (+ c_~A~0.offset (* 4 v_subst_7))))))) (<= (select (select .cse2 c_~A~0.base) c_~A~0.offset) (+ .cse3 1))) (forall ((v_subst_8 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_925))) (let ((.cse6 (select .cse5 c_~A~0.base))) (let ((.cse4 (select .cse6 (+ c_~A~0.offset (* 4 v_subst_8))))) (or (<= .cse4 (+ (select (store (store (select (store (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_926) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_927) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_928) c_~A~0.base) c_~A~0.offset v_ArrVal_929) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork3_~i~2#1_67| 4)) v_ArrVal_932) c_~A~0.offset) 1)) (< (select .cse6 c_~A~0.offset) .cse4))))))) (<= 2147483647 .cse3)))))) is different from false [2022-01-18 12:22:37,584 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_929 Int) (v_ArrVal_926 (Array Int Int)) (v_ArrVal_925 (Array Int Int)) (|v_thread3Thread1of1ForFork3_~i~2#1_67| Int) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_932 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_925))) (let ((.cse6 (select (store (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_926) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_927) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_928) |c_ULTIMATE.start_main_#t~ret16#1.base|))) (let ((.cse5 (select (store (store .cse6 |c_ULTIMATE.start_main_#t~ret16#1.offset| v_ArrVal_929) (+ |c_ULTIMATE.start_main_#t~ret16#1.offset| (* |v_thread3Thread1of1ForFork3_~i~2#1_67| 4)) v_ArrVal_932) |c_ULTIMATE.start_main_#t~ret16#1.offset|))) (or (< |v_thread3Thread1of1ForFork3_~i~2#1_67| 1) (and (forall ((v_subst_8 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_925))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_#t~ret16#1.base|))) (let ((.cse1 (select .cse0 (+ (* 4 v_subst_8) |c_ULTIMATE.start_main_#t~ret16#1.offset|)))) (or (< (select .cse0 |c_ULTIMATE.start_main_#t~ret16#1.offset|) .cse1) (<= .cse1 (+ (select (store (store (select (store (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_926) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_927) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_928) |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset| v_ArrVal_929) (+ |c_ULTIMATE.start_main_#t~ret16#1.offset| (* |v_thread3Thread1of1ForFork3_~i~2#1_67| 4)) v_ArrVal_932) |c_ULTIMATE.start_main_#t~ret16#1.offset|) 1))))))) (or (forall ((v_subst_7 Int)) (not (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_925) |c_ULTIMATE.start_main_#t~ret16#1.base|))) (< (select .cse3 |c_ULTIMATE.start_main_#t~ret16#1.offset|) (select .cse3 (+ (* 4 v_subst_7) |c_ULTIMATE.start_main_#t~ret16#1.offset|)))))) (<= (select (select .cse4 |c_ULTIMATE.start_main_#t~ret16#1.base|) |c_ULTIMATE.start_main_#t~ret16#1.offset|) (+ .cse5 1)))) (not (<= (select .cse6 |c_ULTIMATE.start_main_#t~ret16#1.offset|) (+ v_ArrVal_929 1))) (<= 2147483647 .cse5)))))) is different from false [2022-01-18 12:22:38,478 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_929 Int) (v_ArrVal_926 (Array Int Int)) (v_ArrVal_925 (Array Int Int)) (|v_thread3Thread1of1ForFork3_~i~2#1_67| Int) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_932 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_925))) (let ((.cse6 (select (store (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_926) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_927) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_928) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse4 (select (store (store .cse6 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| v_ArrVal_929) (+ (* |v_thread3Thread1of1ForFork3_~i~2#1_67| 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) v_ArrVal_932) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< |v_thread3Thread1of1ForFork3_~i~2#1_67| 1) (and (forall ((v_subst_8 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_925))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse1 (select .cse0 (+ (* 4 v_subst_8) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) .cse1) (<= .cse1 (+ (select (store (store (select (store (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_926) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_927) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_928) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| v_ArrVal_929) (+ (* |v_thread3Thread1of1ForFork3_~i~2#1_67| 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) v_ArrVal_932) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 1))))))) (or (<= (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (+ .cse4 1)) (forall ((v_subst_7 Int)) (not (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_925) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (< (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (select .cse5 (+ (* 4 v_subst_7) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))))) (<= 2147483647 .cse4) (not (<= (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (+ v_ArrVal_929 1)))))))) is different from false [2022-01-18 12:22:38,956 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_929 Int) (v_ArrVal_926 (Array Int Int)) (v_ArrVal_925 (Array Int Int)) (|v_thread3Thread1of1ForFork3_~i~2#1_67| Int) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_932 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_925))) (let ((.cse1 (select (store (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_926) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_927) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_928) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select (store (store .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_ArrVal_929) (+ (* |v_thread3Thread1of1ForFork3_~i~2#1_67| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_932) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< |v_thread3Thread1of1ForFork3_~i~2#1_67| 1) (<= 2147483647 .cse0) (not (<= (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ v_ArrVal_929 1))) (and (or (forall ((v_subst_7 Int)) (not (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_925) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (< (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select .cse2 (+ (* 4 v_subst_7) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (<= (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ .cse0 1))) (forall ((v_subst_8 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_925))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse4 (select .cse6 (+ (* 4 v_subst_8) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= .cse4 (+ (select (store (store (select (store (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_926) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_927) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_928) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_ArrVal_929) (+ (* |v_thread3Thread1of1ForFork3_~i~2#1_67| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_932) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (< (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse4)))))))))))) is different from false [2022-01-18 12:22:43,104 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:22:43,105 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 298 treesize of output 190 [2022-01-18 12:22:43,110 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 5542 treesize of output 5380 [2022-01-18 12:22:43,127 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 6484 treesize of output 6452 [2022-01-18 12:22:43,148 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 6728 treesize of output 6720 [2022-01-18 12:22:43,199 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 7272 treesize of output 7256 [2022-01-18 12:22:43,245 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:22:43,245 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 7394 treesize of output 6956 [2022-01-18 12:22:43,282 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 12:22:43,282 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 7078 treesize of output 6586