/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-queue-add-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 19:43:26,194 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 19:43:26,196 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 19:43:26,236 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 19:43:26,236 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 19:43:26,237 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 19:43:26,238 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 19:43:26,248 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 19:43:26,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 19:43:26,250 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 19:43:26,251 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 19:43:26,252 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 19:43:26,252 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 19:43:26,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 19:43:26,254 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 19:43:26,255 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 19:43:26,255 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 19:43:26,256 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 19:43:26,257 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 19:43:26,259 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 19:43:26,268 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 19:43:26,272 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 19:43:26,273 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 19:43:26,273 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 19:43:26,276 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 19:43:26,276 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 19:43:26,279 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 19:43:26,280 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 19:43:26,280 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 19:43:26,281 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 19:43:26,281 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 19:43:26,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 19:43:26,283 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 19:43:26,283 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 19:43:26,284 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 19:43:26,284 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 19:43:26,285 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 19:43:26,285 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 19:43:26,285 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 19:43:26,286 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 19:43:26,286 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 19:43:26,287 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 19:43:26,322 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 19:43:26,322 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 19:43:26,323 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 19:43:26,323 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 19:43:26,323 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 19:43:26,323 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 19:43:26,323 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 19:43:26,324 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 19:43:26,324 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 19:43:26,324 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 19:43:26,324 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 19:43:26,324 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 19:43:26,324 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 19:43:26,324 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 19:43:26,324 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 19:43:26,324 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 19:43:26,325 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 19:43:26,325 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 19:43:26,325 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 19:43:26,325 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 19:43:26,325 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 19:43:26,325 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 19:43:26,325 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 19:43:26,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:43:26,326 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 19:43:26,326 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 19:43:26,326 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 19:43:26,326 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 19:43:26,326 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 19:43:26,326 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 19:43:26,326 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 19:43:26,326 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 19:43:26,326 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 19:43:26,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 19:43:26,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 19:43:26,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 19:43:26,571 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 19:43:26,571 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 19:43:26,572 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-queue-add-3.wvr.c [2022-03-15 19:43:26,624 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7e881aa2/38f2b022523d4551a07a486d4001190f/FLAG1cef7d4da [2022-03-15 19:43:27,021 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 19:43:27,021 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-queue-add-3.wvr.c [2022-03-15 19:43:27,028 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7e881aa2/38f2b022523d4551a07a486d4001190f/FLAG1cef7d4da [2022-03-15 19:43:27,039 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7e881aa2/38f2b022523d4551a07a486d4001190f [2022-03-15 19:43:27,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 19:43:27,043 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 19:43:27,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 19:43:27,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 19:43:27,050 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 19:43:27,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:43:27" (1/1) ... [2022-03-15 19:43:27,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45ab4aaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:27, skipping insertion in model container [2022-03-15 19:43:27,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:43:27" (1/1) ... [2022-03-15 19:43:27,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 19:43:27,082 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 19:43:27,234 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-queue-add-3.wvr.c[3412,3425] [2022-03-15 19:43:27,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:43:27,250 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 19:43:27,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-queue-add-3.wvr.c[3412,3425] [2022-03-15 19:43:27,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:43:27,284 INFO L208 MainTranslator]: Completed translation [2022-03-15 19:43:27,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:27 WrapperNode [2022-03-15 19:43:27,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 19:43:27,285 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 19:43:27,286 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 19:43:27,286 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 19:43:27,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:27" (1/1) ... [2022-03-15 19:43:27,297 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:27" (1/1) ... [2022-03-15 19:43:27,322 INFO L137 Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 245 [2022-03-15 19:43:27,323 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 19:43:27,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 19:43:27,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 19:43:27,324 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 19:43:27,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:27" (1/1) ... [2022-03-15 19:43:27,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:27" (1/1) ... [2022-03-15 19:43:27,334 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:27" (1/1) ... [2022-03-15 19:43:27,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:27" (1/1) ... [2022-03-15 19:43:27,341 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:27" (1/1) ... [2022-03-15 19:43:27,345 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:27" (1/1) ... [2022-03-15 19:43:27,347 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:27" (1/1) ... [2022-03-15 19:43:27,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 19:43:27,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 19:43:27,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 19:43:27,352 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 19:43:27,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:27" (1/1) ... [2022-03-15 19:43:27,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:43:27,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:27,385 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 19:43:27,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 19:43:27,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 19:43:27,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 19:43:27,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 19:43:27,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 19:43:27,417 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 19:43:27,418 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 19:43:27,418 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 19:43:27,418 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 19:43:27,418 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 19:43:27,418 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 19:43:27,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 19:43:27,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 19:43:27,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 19:43:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 19:43:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 19:43:27,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 19:43:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 19:43:27,423 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 19:43:27,498 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 19:43:27,499 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 19:43:27,840 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 19:43:27,930 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 19:43:27,930 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-03-15 19:43:27,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:43:27 BoogieIcfgContainer [2022-03-15 19:43:27,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 19:43:27,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 19:43:27,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 19:43:27,936 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 19:43:27,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 07:43:27" (1/3) ... [2022-03-15 19:43:27,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@228ee1c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:43:27, skipping insertion in model container [2022-03-15 19:43:27,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:43:27" (2/3) ... [2022-03-15 19:43:27,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@228ee1c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:43:27, skipping insertion in model container [2022-03-15 19:43:27,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:43:27" (3/3) ... [2022-03-15 19:43:27,938 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-3.wvr.c [2022-03-15 19:43:27,942 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 19:43:27,942 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 19:43:27,942 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 19:43:27,943 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 19:43:27,977 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,977 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,978 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,978 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,978 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,978 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,978 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,979 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,979 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,979 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,979 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,979 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,980 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,980 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,980 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,980 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,980 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,981 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,981 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,981 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,981 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,981 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,982 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,982 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,982 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,982 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,982 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,982 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,983 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,983 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,983 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,983 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,983 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,983 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,984 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,984 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,984 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,984 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,984 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,985 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,985 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,985 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,985 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,985 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,985 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,985 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,985 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,986 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,986 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,986 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,986 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,986 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,987 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,987 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,987 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,987 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,987 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,988 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,988 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,989 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,989 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,989 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,991 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,991 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,991 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,991 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,992 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,992 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,992 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,993 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,993 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,993 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,994 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,994 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,994 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,994 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,994 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,994 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,994 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,996 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,996 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,996 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,996 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,996 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,997 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,997 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,997 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:27,998 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:28,000 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:28,004 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:28,010 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:28,010 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:28,011 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:28,011 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:28,011 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:28,011 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:28,011 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:28,012 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:28,012 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:28,012 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:28,013 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:28,013 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:28,013 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:28,013 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:28,013 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:28,013 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:28,014 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:28,014 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:28,014 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:28,014 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:28,014 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:28,015 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:28,015 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:28,015 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:28,015 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:28,015 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:43:28,018 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 19:43:28,055 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 19:43:28,060 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 19:43:28,060 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 19:43:28,073 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 19:43:28,079 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 211 transitions, 446 flow [2022-03-15 19:43:28,081 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 203 places, 211 transitions, 446 flow [2022-03-15 19:43:28,084 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 203 places, 211 transitions, 446 flow [2022-03-15 19:43:28,155 INFO L129 PetriNetUnfolder]: 18/208 cut-off events. [2022-03-15 19:43:28,155 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 19:43:28,159 INFO L84 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 208 events. 18/208 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 111 event pairs, 0 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 170. Up to 3 conditions per place. [2022-03-15 19:43:28,162 INFO L116 LiptonReduction]: Number of co-enabled transitions 1456 [2022-03-15 19:43:35,178 INFO L131 LiptonReduction]: Checked pairs total: 2319 [2022-03-15 19:43:35,179 INFO L133 LiptonReduction]: Total number of compositions: 218 [2022-03-15 19:43:35,191 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 32 transitions, 88 flow [2022-03-15 19:43:35,220 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 138 states, 137 states have (on average 3.343065693430657) internal successors, (458), 137 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:35,222 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 137 states have (on average 3.343065693430657) internal successors, (458), 137 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:35,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:43:35,229 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:35,230 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:35,230 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:43:35,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:35,235 INFO L85 PathProgramCache]: Analyzing trace with hash 2122418462, now seen corresponding path program 1 times [2022-03-15 19:43:35,251 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:35,251 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695444450] [2022-03-15 19:43:35,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:35,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:35,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:35,478 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:35,478 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695444450] [2022-03-15 19:43:35,479 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695444450] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:43:35,479 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:43:35,479 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 19:43:35,480 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2061739070] [2022-03-15 19:43:35,481 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:35,497 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:35,530 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 105 transitions. [2022-03-15 19:43:35,530 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:35,770 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:43:35,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-15 19:43:35,771 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:35,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-15 19:43:35,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 19:43:35,793 INFO L87 Difference]: Start difference. First operand has 138 states, 137 states have (on average 3.343065693430657) internal successors, (458), 137 states have internal predecessors, (458), 0 states have call successors, (0), 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 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:35,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:35,833 INFO L93 Difference]: Finished difference Result 138 states and 428 transitions. [2022-03-15 19:43:35,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 19:43:35,835 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:43:35,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:35,844 INFO L225 Difference]: With dead ends: 138 [2022-03-15 19:43:35,844 INFO L226 Difference]: Without dead ends: 138 [2022-03-15 19:43:35,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-03-15 19:43:35,848 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:35,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:43:35,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-03-15 19:43:35,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-03-15 19:43:35,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 3.124087591240876) internal successors, (428), 137 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:35,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 428 transitions. [2022-03-15 19:43:35,882 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 428 transitions. Word has length 21 [2022-03-15 19:43:35,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:35,882 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 428 transitions. [2022-03-15 19:43:35,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:35,883 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 428 transitions. [2022-03-15 19:43:35,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:43:35,884 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:35,884 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] [2022-03-15 19:43:35,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 19:43:35,885 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:43:35,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:35,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1367950956, now seen corresponding path program 1 times [2022-03-15 19:43:35,886 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:35,886 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997075974] [2022-03-15 19:43:35,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:35,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:36,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:36,019 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:36,019 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997075974] [2022-03-15 19:43:36,020 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997075974] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:43:36,020 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:43:36,020 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:43:36,020 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [949039825] [2022-03-15 19:43:36,020 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:36,025 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:36,033 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 42 transitions. [2022-03-15 19:43:36,033 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:36,133 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:43:36,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:43:36,134 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:36,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:43:36,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:43:36,135 INFO L87 Difference]: Start difference. First operand 138 states and 428 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:36,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:36,199 INFO L93 Difference]: Finished difference Result 177 states and 515 transitions. [2022-03-15 19:43:36,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:43:36,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:43:36,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:36,201 INFO L225 Difference]: With dead ends: 177 [2022-03-15 19:43:36,201 INFO L226 Difference]: Without dead ends: 139 [2022-03-15 19:43:36,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:43:36,202 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:36,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 9 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:43:36,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-03-15 19:43:36,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-03-15 19:43:36,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 3.108695652173913) internal successors, (429), 138 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:36,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 429 transitions. [2022-03-15 19:43:36,214 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 429 transitions. Word has length 22 [2022-03-15 19:43:36,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:36,215 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 429 transitions. [2022-03-15 19:43:36,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:36,215 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 429 transitions. [2022-03-15 19:43:36,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:43:36,216 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:36,216 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] [2022-03-15 19:43:36,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 19:43:36,217 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:43:36,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:36,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1734255192, now seen corresponding path program 1 times [2022-03-15 19:43:36,218 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:36,218 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910165807] [2022-03-15 19:43:36,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:36,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:36,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:43:36,289 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:36,289 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910165807] [2022-03-15 19:43:36,289 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910165807] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:43:36,289 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:43:36,289 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 19:43:36,290 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [785139396] [2022-03-15 19:43:36,290 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:36,294 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:36,308 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 43 transitions. [2022-03-15 19:43:36,308 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:36,413 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:43:36,439 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:43:36,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:43:36,440 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:36,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:43:36,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:43:36,441 INFO L87 Difference]: Start difference. First operand 139 states and 429 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:36,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:36,520 INFO L93 Difference]: Finished difference Result 213 states and 614 transitions. [2022-03-15 19:43:36,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:43:36,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:43:36,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:36,521 INFO L225 Difference]: With dead ends: 213 [2022-03-15 19:43:36,521 INFO L226 Difference]: Without dead ends: 140 [2022-03-15 19:43:36,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:43:36,523 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 21 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:36,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 9 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:43:36,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-03-15 19:43:36,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-03-15 19:43:36,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 3.093525179856115) internal successors, (430), 139 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:36,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 430 transitions. [2022-03-15 19:43:36,531 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 430 transitions. Word has length 23 [2022-03-15 19:43:36,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:36,532 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 430 transitions. [2022-03-15 19:43:36,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:36,532 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 430 transitions. [2022-03-15 19:43:36,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:43:36,533 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:36,533 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] [2022-03-15 19:43:36,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 19:43:36,533 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:43:36,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:36,534 INFO L85 PathProgramCache]: Analyzing trace with hash 934511800, now seen corresponding path program 1 times [2022-03-15 19:43:36,535 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:36,535 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407581261] [2022-03-15 19:43:36,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:36,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:36,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:43:36,815 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:36,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407581261] [2022-03-15 19:43:36,818 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407581261] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:43:36,818 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:43:36,818 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 19:43:36,818 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [137632983] [2022-03-15 19:43:36,818 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:36,823 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:36,831 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 44 transitions. [2022-03-15 19:43:36,831 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:37,087 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:43:37,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 19:43:37,090 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:37,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 19:43:37,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-03-15 19:43:37,090 INFO L87 Difference]: Start difference. First operand 140 states and 430 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:37,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:37,221 INFO L93 Difference]: Finished difference Result 309 states and 965 transitions. [2022-03-15 19:43:37,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:43:37,222 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:43:37,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:37,224 INFO L225 Difference]: With dead ends: 309 [2022-03-15 19:43:37,224 INFO L226 Difference]: Without dead ends: 290 [2022-03-15 19:43:37,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-03-15 19:43:37,225 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 53 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:37,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 23 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:43:37,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-03-15 19:43:37,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 236. [2022-03-15 19:43:37,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 3.1404255319148935) internal successors, (738), 235 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:37,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 738 transitions. [2022-03-15 19:43:37,238 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 738 transitions. Word has length 24 [2022-03-15 19:43:37,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:37,238 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 738 transitions. [2022-03-15 19:43:37,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:37,238 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 738 transitions. [2022-03-15 19:43:37,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:43:37,244 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:37,244 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] [2022-03-15 19:43:37,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 19:43:37,244 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:43:37,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:37,245 INFO L85 PathProgramCache]: Analyzing trace with hash 2134547335, now seen corresponding path program 1 times [2022-03-15 19:43:37,248 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:37,248 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626944935] [2022-03-15 19:43:37,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:37,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:37,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:43:37,335 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:37,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626944935] [2022-03-15 19:43:37,337 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626944935] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:37,337 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482023383] [2022-03-15 19:43:37,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:37,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:37,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:37,342 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:37,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 19:43:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:37,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:43:37,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:37,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:43:37,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:37,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:43:37,655 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482023383] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:37,655 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:37,656 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-03-15 19:43:37,656 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [968745799] [2022-03-15 19:43:37,656 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:37,661 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:37,669 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 45 transitions. [2022-03-15 19:43:37,669 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:37,779 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:43:37,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:43:37,779 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:37,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:43:37,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:43:37,780 INFO L87 Difference]: Start difference. First operand 236 states and 738 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:37,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:37,893 INFO L93 Difference]: Finished difference Result 470 states and 1408 transitions. [2022-03-15 19:43:37,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:43:37,893 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 19:43:37,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:37,896 INFO L225 Difference]: With dead ends: 470 [2022-03-15 19:43:37,896 INFO L226 Difference]: Without dead ends: 368 [2022-03-15 19:43:37,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-03-15 19:43:37,897 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 38 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:37,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 24 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:43:37,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-03-15 19:43:37,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 284. [2022-03-15 19:43:37,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 3.067137809187279) internal successors, (868), 283 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:37,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 868 transitions. [2022-03-15 19:43:37,908 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 868 transitions. Word has length 25 [2022-03-15 19:43:37,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:37,908 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 868 transitions. [2022-03-15 19:43:37,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:37,908 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 868 transitions. [2022-03-15 19:43:37,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:43:37,909 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:37,909 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] [2022-03-15 19:43:37,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:38,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:38,133 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:43:38,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:38,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1117050351, now seen corresponding path program 1 times [2022-03-15 19:43:38,135 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:38,135 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615044929] [2022-03-15 19:43:38,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:38,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:38,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:43:38,286 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:38,286 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615044929] [2022-03-15 19:43:38,287 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615044929] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:43:38,287 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:43:38,287 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:43:38,287 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1764201825] [2022-03-15 19:43:38,287 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:38,292 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:38,303 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 55 transitions. [2022-03-15 19:43:38,303 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:38,331 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:43:38,359 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2022-03-15 19:43:38,559 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [3846#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 3847#(or (< ~q2_front~0 0) (<= ~q2_back~0 (+ 1 ~q2_front~0)))] [2022-03-15 19:43:38,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:43:38,559 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:38,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:43:38,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:43:38,560 INFO L87 Difference]: Start difference. First operand 284 states and 868 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:38,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:38,648 INFO L93 Difference]: Finished difference Result 552 states and 1662 transitions. [2022-03-15 19:43:38,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:43:38,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 19:43:38,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:38,652 INFO L225 Difference]: With dead ends: 552 [2022-03-15 19:43:38,652 INFO L226 Difference]: Without dead ends: 528 [2022-03-15 19:43:38,652 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:43:38,654 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 46 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:38,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 11 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:43:38,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-03-15 19:43:38,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 448. [2022-03-15 19:43:38,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 3.161073825503356) internal successors, (1413), 447 states have internal predecessors, (1413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:38,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 1413 transitions. [2022-03-15 19:43:38,669 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 1413 transitions. Word has length 25 [2022-03-15 19:43:38,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:38,670 INFO L470 AbstractCegarLoop]: Abstraction has 448 states and 1413 transitions. [2022-03-15 19:43:38,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:38,670 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 1413 transitions. [2022-03-15 19:43:38,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:43:38,672 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:38,672 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:38,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 19:43:38,673 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:43:38,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:38,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1218015501, now seen corresponding path program 2 times [2022-03-15 19:43:38,676 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:38,676 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682069573] [2022-03-15 19:43:38,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:38,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:39,138 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:43:39,139 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:39,139 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682069573] [2022-03-15 19:43:39,139 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682069573] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:39,139 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010434934] [2022-03-15 19:43:39,139 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:43:39,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:39,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:39,140 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:39,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 19:43:39,258 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:43:39,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:39,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 19:43:39,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:39,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:39,494 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:43:39,536 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:43:39,566 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:43:39,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:39,616 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_229 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_229) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) 0))) is different from false [2022-03-15 19:43:39,680 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:43:39,681 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2022-03-15 19:43:39,685 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-03-15 19:43:39,919 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:43:39,920 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010434934] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:39,920 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:39,920 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-03-15 19:43:39,920 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [405512292] [2022-03-15 19:43:39,920 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:39,925 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:39,934 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 46 transitions. [2022-03-15 19:43:39,934 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:40,018 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:43:40,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:43:40,019 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:40,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:43:40,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=472, Unknown=1, NotChecked=44, Total=600 [2022-03-15 19:43:40,020 INFO L87 Difference]: Start difference. First operand 448 states and 1413 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:40,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:40,331 INFO L93 Difference]: Finished difference Result 552 states and 1727 transitions. [2022-03-15 19:43:40,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 19:43:40,331 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:43:40,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:40,335 INFO L225 Difference]: With dead ends: 552 [2022-03-15 19:43:40,335 INFO L226 Difference]: Without dead ends: 552 [2022-03-15 19:43:40,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=472, Unknown=1, NotChecked=44, Total=600 [2022-03-15 19:43:40,336 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 37 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:40,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 81 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:43:40,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2022-03-15 19:43:40,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 546. [2022-03-15 19:43:40,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 545 states have (on average 3.143119266055046) internal successors, (1713), 545 states have internal predecessors, (1713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:40,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1713 transitions. [2022-03-15 19:43:40,350 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1713 transitions. Word has length 26 [2022-03-15 19:43:40,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:40,350 INFO L470 AbstractCegarLoop]: Abstraction has 546 states and 1713 transitions. [2022-03-15 19:43:40,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:40,350 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1713 transitions. [2022-03-15 19:43:40,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:43:40,352 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:40,352 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:40,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:40,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-03-15 19:43:40,568 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:43:40,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:40,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1055685383, now seen corresponding path program 3 times [2022-03-15 19:43:40,569 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:40,569 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420728814] [2022-03-15 19:43:40,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:40,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:41,116 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:43:41,117 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:41,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420728814] [2022-03-15 19:43:41,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420728814] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:41,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974350730] [2022-03-15 19:43:41,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:43:41,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:41,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:41,119 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:41,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 19:43:41,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:43:41,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:41,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 19:43:41,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:41,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:41,522 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:43:41,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:41,591 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:43:41,626 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:43:41,658 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:43:41,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:41,721 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_287) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) 0))) is different from false [2022-03-15 19:43:41,732 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array Int Int)) (v_ArrVal_286 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_287) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) 0))) is different from false [2022-03-15 19:43:41,812 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:43:41,812 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 85 treesize of output 85 [2022-03-15 19:43:41,816 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 64 treesize of output 52 [2022-03-15 19:43:41,820 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 52 treesize of output 46 [2022-03-15 19:43:42,108 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:43:42,108 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974350730] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:42,108 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:42,108 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2022-03-15 19:43:42,108 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [338160626] [2022-03-15 19:43:42,109 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:42,113 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:42,153 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 105 transitions. [2022-03-15 19:43:42,153 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:42,416 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:43:42,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:43:42,416 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:42,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:43:42,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=613, Unknown=2, NotChecked=102, Total=812 [2022-03-15 19:43:42,417 INFO L87 Difference]: Start difference. First operand 546 states and 1713 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:42,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:42,865 INFO L93 Difference]: Finished difference Result 626 states and 1959 transitions. [2022-03-15 19:43:42,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:43:42,866 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:43:42,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:42,870 INFO L225 Difference]: With dead ends: 626 [2022-03-15 19:43:42,870 INFO L226 Difference]: Without dead ends: 626 [2022-03-15 19:43:42,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=613, Unknown=2, NotChecked=102, Total=812 [2022-03-15 19:43:42,871 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 37 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:42,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 107 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:43:42,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2022-03-15 19:43:42,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 546. [2022-03-15 19:43:42,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 545 states have (on average 3.143119266055046) internal successors, (1713), 545 states have internal predecessors, (1713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:42,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1713 transitions. [2022-03-15 19:43:42,889 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1713 transitions. Word has length 26 [2022-03-15 19:43:42,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:42,889 INFO L470 AbstractCegarLoop]: Abstraction has 546 states and 1713 transitions. [2022-03-15 19:43:42,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:42,889 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1713 transitions. [2022-03-15 19:43:42,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:43:42,891 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:42,891 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:42,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:43,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:43,106 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:43:43,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:43,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1263282061, now seen corresponding path program 4 times [2022-03-15 19:43:43,107 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:43,107 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362602195] [2022-03-15 19:43:43,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:43,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:43,498 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:43:43,498 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:43,498 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362602195] [2022-03-15 19:43:43,498 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362602195] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:43,498 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847538022] [2022-03-15 19:43:43,499 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:43:43,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:43,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:43,504 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:43,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 19:43:43,617 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:43:43,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:43,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 19:43:43,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:43,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:43,717 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:43:43,741 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:43:43,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:43:43,771 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 19:43:43,771 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847538022] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:43:43,772 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 19:43:43,772 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2022-03-15 19:43:43,772 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [640152108] [2022-03-15 19:43:43,772 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:43,778 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:43,790 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 60 transitions. [2022-03-15 19:43:43,790 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:44,023 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [9102#(or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (< ~q1_back~0 0))] [2022-03-15 19:43:44,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 19:43:44,023 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:44,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 19:43:44,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2022-03-15 19:43:44,024 INFO L87 Difference]: Start difference. First operand 546 states and 1713 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:44,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:44,175 INFO L93 Difference]: Finished difference Result 546 states and 1590 transitions. [2022-03-15 19:43:44,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:43:44,176 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:43:44,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:44,179 INFO L225 Difference]: With dead ends: 546 [2022-03-15 19:43:44,179 INFO L226 Difference]: Without dead ends: 546 [2022-03-15 19:43:44,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2022-03-15 19:43:44,180 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 35 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:44,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 30 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:43:44,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-03-15 19:43:44,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 404. [2022-03-15 19:43:44,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 403 states have (on average 2.8883374689826304) internal successors, (1164), 403 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:44,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1164 transitions. [2022-03-15 19:43:44,191 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 1164 transitions. Word has length 26 [2022-03-15 19:43:44,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:44,192 INFO L470 AbstractCegarLoop]: Abstraction has 404 states and 1164 transitions. [2022-03-15 19:43:44,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:44,192 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 1164 transitions. [2022-03-15 19:43:44,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:43:44,193 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:44,194 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:44,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:44,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:44,399 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:43:44,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:44,400 INFO L85 PathProgramCache]: Analyzing trace with hash 2000548423, now seen corresponding path program 5 times [2022-03-15 19:43:44,401 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:44,401 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295054834] [2022-03-15 19:43:44,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:44,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:44,928 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:43:44,928 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:44,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295054834] [2022-03-15 19:43:44,928 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295054834] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:44,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518658801] [2022-03-15 19:43:44,929 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:43:44,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:44,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:44,930 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:44,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 19:43:45,040 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:43:45,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:45,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 19:43:45,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:45,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:45,299 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:43:45,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:45,373 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:43:45,417 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:43:45,459 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:43:45,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:45,682 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:43:45,682 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 85 treesize of output 85 [2022-03-15 19:43:45,686 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 64 treesize of output 52 [2022-03-15 19:43:45,690 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 52 treesize of output 46 [2022-03-15 19:43:45,968 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:43:45,968 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518658801] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:45,968 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:45,968 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 27 [2022-03-15 19:43:45,968 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1326570655] [2022-03-15 19:43:45,968 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:45,973 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:45,989 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 114 transitions. [2022-03-15 19:43:45,989 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:46,592 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [10637#(or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))] [2022-03-15 19:43:46,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:43:46,592 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:46,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:43:46,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=678, Unknown=4, NotChecked=0, Total=812 [2022-03-15 19:43:46,593 INFO L87 Difference]: Start difference. First operand 404 states and 1164 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:46,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:46,894 INFO L93 Difference]: Finished difference Result 538 states and 1528 transitions. [2022-03-15 19:43:46,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 19:43:46,895 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:43:46,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:46,898 INFO L225 Difference]: With dead ends: 538 [2022-03-15 19:43:46,898 INFO L226 Difference]: Without dead ends: 531 [2022-03-15 19:43:46,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=130, Invalid=678, Unknown=4, NotChecked=0, Total=812 [2022-03-15 19:43:46,899 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 64 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:46,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 68 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:43:46,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2022-03-15 19:43:46,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 409. [2022-03-15 19:43:46,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 408 states have (on average 2.9019607843137254) internal successors, (1184), 408 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:46,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 1184 transitions. [2022-03-15 19:43:46,909 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 1184 transitions. Word has length 26 [2022-03-15 19:43:46,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:46,909 INFO L470 AbstractCegarLoop]: Abstraction has 409 states and 1184 transitions. [2022-03-15 19:43:46,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:46,909 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 1184 transitions. [2022-03-15 19:43:46,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:43:46,911 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:46,911 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:46,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:47,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-15 19:43:47,127 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:43:47,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:47,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1892346561, now seen corresponding path program 6 times [2022-03-15 19:43:47,128 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:47,129 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646827908] [2022-03-15 19:43:47,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:47,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:47,501 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:43:47,501 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:47,501 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646827908] [2022-03-15 19:43:47,501 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646827908] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:47,501 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291898360] [2022-03-15 19:43:47,501 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:43:47,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:47,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:47,508 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:47,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 19:43:47,624 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 19:43:47,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:47,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 19:43:47,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:47,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:47,641 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 44 treesize of output 42 [2022-03-15 19:43:47,857 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:43:47,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:47,925 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:43:47,961 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:43:48,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:43:48,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:48,198 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:43:48,198 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 159 [2022-03-15 19:43:48,205 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 126 [2022-03-15 19:43:48,209 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 102 [2022-03-15 19:43:48,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:43:48,467 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291898360] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:48,468 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:48,468 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 26 [2022-03-15 19:43:48,468 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [885587726] [2022-03-15 19:43:48,468 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:48,472 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:48,492 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 114 transitions. [2022-03-15 19:43:48,493 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:49,055 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [12171#(or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))] [2022-03-15 19:43:49,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:43:49,056 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:49,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:43:49,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=635, Unknown=2, NotChecked=0, Total=756 [2022-03-15 19:43:49,057 INFO L87 Difference]: Start difference. First operand 409 states and 1184 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:49,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:49,332 INFO L93 Difference]: Finished difference Result 537 states and 1556 transitions. [2022-03-15 19:43:49,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:43:49,335 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:43:49,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:49,338 INFO L225 Difference]: With dead ends: 537 [2022-03-15 19:43:49,338 INFO L226 Difference]: Without dead ends: 537 [2022-03-15 19:43:49,339 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=686, Unknown=2, NotChecked=0, Total=812 [2022-03-15 19:43:49,339 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 33 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:49,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 52 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:43:49,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2022-03-15 19:43:49,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 390. [2022-03-15 19:43:49,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 2.853470437017995) internal successors, (1110), 389 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:49,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1110 transitions. [2022-03-15 19:43:49,349 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1110 transitions. Word has length 26 [2022-03-15 19:43:49,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:49,349 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 1110 transitions. [2022-03-15 19:43:49,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:49,350 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1110 transitions. [2022-03-15 19:43:49,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:43:49,351 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:49,351 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:49,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:49,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:49,575 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:43:49,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:49,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1905918195, now seen corresponding path program 7 times [2022-03-15 19:43:49,576 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:49,576 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837687402] [2022-03-15 19:43:49,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:49,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:50,102 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:43:50,102 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:50,103 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837687402] [2022-03-15 19:43:50,103 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837687402] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:50,103 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869143730] [2022-03-15 19:43:50,103 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:43:50,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:50,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:50,108 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:50,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 19:43:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:50,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 19:43:50,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:50,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:50,460 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:43:50,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:50,493 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:43:50,516 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:43:50,546 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:43:50,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:50,606 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_525 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_525) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) 0))) is different from false [2022-03-15 19:43:50,617 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_524 (Array Int Int)) (v_ArrVal_525 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_524) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_525) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) 0))) is different from false [2022-03-15 19:43:50,634 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:43:50,634 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 85 treesize of output 85 [2022-03-15 19:43:50,638 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 64 treesize of output 58 [2022-03-15 19:43:50,641 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 46 [2022-03-15 19:43:50,822 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 1 not checked. [2022-03-15 19:43:50,823 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869143730] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:50,823 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:50,823 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 29 [2022-03-15 19:43:50,823 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [279730513] [2022-03-15 19:43:50,823 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:50,828 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:50,844 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 106 transitions. [2022-03-15 19:43:50,845 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:51,130 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:43:51,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:43:51,131 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:51,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:43:51,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=668, Unknown=2, NotChecked=106, Total=870 [2022-03-15 19:43:51,131 INFO L87 Difference]: Start difference. First operand 390 states and 1110 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:51,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:51,658 INFO L93 Difference]: Finished difference Result 572 states and 1658 transitions. [2022-03-15 19:43:51,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:43:51,659 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 19:43:51,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:51,661 INFO L225 Difference]: With dead ends: 572 [2022-03-15 19:43:51,661 INFO L226 Difference]: Without dead ends: 572 [2022-03-15 19:43:51,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=132, Invalid=930, Unknown=2, NotChecked=126, Total=1190 [2022-03-15 19:43:51,662 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 40 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:51,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 57 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:43:51,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2022-03-15 19:43:51,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 416. [2022-03-15 19:43:51,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 2.872289156626506) internal successors, (1192), 415 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:51,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1192 transitions. [2022-03-15 19:43:51,673 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1192 transitions. Word has length 27 [2022-03-15 19:43:51,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:51,673 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 1192 transitions. [2022-03-15 19:43:51,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:51,673 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1192 transitions. [2022-03-15 19:43:51,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:43:51,674 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:51,674 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:51,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-03-15 19:43:51,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:51,888 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:43:51,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:51,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1150315611, now seen corresponding path program 8 times [2022-03-15 19:43:51,889 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:51,889 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240793177] [2022-03-15 19:43:51,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:51,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:52,290 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:43:52,290 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:52,291 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240793177] [2022-03-15 19:43:52,291 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240793177] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:52,291 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263583934] [2022-03-15 19:43:52,291 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:43:52,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:52,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:52,292 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:52,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 19:43:52,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:43:52,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:52,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 19:43:52,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:52,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:52,531 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:43:52,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:52,573 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:43:52,591 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:43:52,613 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:43:52,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:52,656 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_587 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) 0))) is different from false [2022-03-15 19:43:52,671 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_586 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_587) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) 0))) is different from false [2022-03-15 19:43:52,683 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:43:52,683 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 167 treesize of output 159 [2022-03-15 19:43:52,687 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 114 [2022-03-15 19:43:52,690 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 114 treesize of output 102 [2022-03-15 19:43:52,822 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 19:43:52,822 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263583934] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:52,822 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:43:52,823 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 8] total 23 [2022-03-15 19:43:52,823 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [661659468] [2022-03-15 19:43:52,823 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:52,828 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:52,844 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 115 transitions. [2022-03-15 19:43:52,844 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:53,336 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [15271#(or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (< ~q1_back~0 0))] [2022-03-15 19:43:53,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:43:53,336 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:53,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:43:53,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=445, Unknown=2, NotChecked=86, Total=600 [2022-03-15 19:43:53,337 INFO L87 Difference]: Start difference. First operand 416 states and 1192 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:53,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:53,503 INFO L93 Difference]: Finished difference Result 515 states and 1537 transitions. [2022-03-15 19:43:53,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:43:53,504 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 19:43:53,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:53,507 INFO L225 Difference]: With dead ends: 515 [2022-03-15 19:43:53,507 INFO L226 Difference]: Without dead ends: 515 [2022-03-15 19:43:53,507 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=531, Unknown=2, NotChecked=94, Total=702 [2022-03-15 19:43:53,508 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 22 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:53,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 39 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 198 Invalid, 0 Unknown, 156 Unchecked, 0.1s Time] [2022-03-15 19:43:53,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-03-15 19:43:53,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 429. [2022-03-15 19:43:53,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 428 states have (on average 2.9042056074766354) internal successors, (1243), 428 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:53,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1243 transitions. [2022-03-15 19:43:53,519 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 1243 transitions. Word has length 27 [2022-03-15 19:43:53,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:53,519 INFO L470 AbstractCegarLoop]: Abstraction has 429 states and 1243 transitions. [2022-03-15 19:43:53,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:53,520 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 1243 transitions. [2022-03-15 19:43:53,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:43:53,521 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:53,521 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:53,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-15 19:43:53,733 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,SelfDestructingSolverStorable12 [2022-03-15 19:43:53,734 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:43:53,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:53,734 INFO L85 PathProgramCache]: Analyzing trace with hash -547865631, now seen corresponding path program 9 times [2022-03-15 19:43:53,735 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:53,735 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749536888] [2022-03-15 19:43:53,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:53,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:54,234 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:43:54,234 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:54,234 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749536888] [2022-03-15 19:43:54,234 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749536888] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:54,234 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076650247] [2022-03-15 19:43:54,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:43:54,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:54,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:54,236 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:54,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 19:43:54,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:43:54,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:54,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:43:54,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:54,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:54,488 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:43:54,507 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:43:54,535 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 19:43:54,535 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 19:43:54,536 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076650247] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:43:54,536 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 19:43:54,536 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2022-03-15 19:43:54,536 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [193275165] [2022-03-15 19:43:54,536 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:54,541 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:54,560 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 125 transitions. [2022-03-15 19:43:54,561 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:55,206 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [16743#(or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (< ~q1_back~0 0)), 16742#(and (or (= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 1)) (< ~q1_back~0 0)) (or (< (+ ~q1~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 1)) (< ~q1_back~0 0)))] [2022-03-15 19:43:55,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:43:55,207 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:55,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:43:55,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-03-15 19:43:55,208 INFO L87 Difference]: Start difference. First operand 429 states and 1243 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:55,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:55,368 INFO L93 Difference]: Finished difference Result 555 states and 1607 transitions. [2022-03-15 19:43:55,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:43:55,369 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 19:43:55,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:55,372 INFO L225 Difference]: With dead ends: 555 [2022-03-15 19:43:55,372 INFO L226 Difference]: Without dead ends: 555 [2022-03-15 19:43:55,373 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-03-15 19:43:55,374 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 44 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:55,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 30 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:43:55,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2022-03-15 19:43:55,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 399. [2022-03-15 19:43:55,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 398 states have (on average 2.886934673366834) internal successors, (1149), 398 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:55,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1149 transitions. [2022-03-15 19:43:55,392 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1149 transitions. Word has length 27 [2022-03-15 19:43:55,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:55,392 INFO L470 AbstractCegarLoop]: Abstraction has 399 states and 1149 transitions. [2022-03-15 19:43:55,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:55,392 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1149 transitions. [2022-03-15 19:43:55,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:43:55,394 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:55,394 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:55,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:55,607 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,SelfDestructingSolverStorable13 [2022-03-15 19:43:55,607 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:43:55,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:55,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1528672945, now seen corresponding path program 1 times [2022-03-15 19:43:55,609 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:55,609 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785648709] [2022-03-15 19:43:55,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:55,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:55,668 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:43:55,668 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:55,669 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785648709] [2022-03-15 19:43:55,669 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785648709] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:55,669 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776873995] [2022-03-15 19:43:55,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:55,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:55,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:55,670 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:55,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 19:43:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:55,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:43:55,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:55,860 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:43:55,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:55,941 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:43:55,941 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776873995] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:55,942 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:55,942 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-03-15 19:43:55,942 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [37242759] [2022-03-15 19:43:55,942 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:55,946 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:55,954 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 57 transitions. [2022-03-15 19:43:55,954 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:55,969 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:43:55,992 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2022-03-15 19:43:56,120 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [18267#(or (<= ~q2_back~0 0) (<= ~n2~0 0))] [2022-03-15 19:43:56,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 19:43:56,121 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:56,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 19:43:56,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-03-15 19:43:56,121 INFO L87 Difference]: Start difference. First operand 399 states and 1149 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:56,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:56,247 INFO L93 Difference]: Finished difference Result 715 states and 1973 transitions. [2022-03-15 19:43:56,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:43:56,247 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 19:43:56,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:56,249 INFO L225 Difference]: With dead ends: 715 [2022-03-15 19:43:56,249 INFO L226 Difference]: Without dead ends: 497 [2022-03-15 19:43:56,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-03-15 19:43:56,250 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 52 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:56,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 21 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:43:56,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2022-03-15 19:43:56,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 469. [2022-03-15 19:43:56,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 2.8675213675213675) internal successors, (1342), 468 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:56,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1342 transitions. [2022-03-15 19:43:56,262 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 1342 transitions. Word has length 27 [2022-03-15 19:43:56,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:56,262 INFO L470 AbstractCegarLoop]: Abstraction has 469 states and 1342 transitions. [2022-03-15 19:43:56,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:56,262 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 1342 transitions. [2022-03-15 19:43:56,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:43:56,264 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:56,264 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:56,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:56,479 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,SelfDestructingSolverStorable14 [2022-03-15 19:43:56,479 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:43:56,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:56,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1801635705, now seen corresponding path program 10 times [2022-03-15 19:43:56,480 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:56,481 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501758346] [2022-03-15 19:43:56,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:56,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:57,405 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:43:57,405 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:57,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501758346] [2022-03-15 19:43:57,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501758346] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:57,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242345124] [2022-03-15 19:43:57,405 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:43:57,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:57,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:57,407 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:57,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 19:43:57,517 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:43:57,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:57,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 19:43:57,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:57,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:57,732 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:43:57,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:43:57,765 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:43:57,786 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:43:57,813 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:43:57,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:57,849 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_766 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_766) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) 0))) is different from false [2022-03-15 19:43:57,857 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_765 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_765) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_766) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) 0))) is different from false [2022-03-15 19:43:57,870 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:43:57,871 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 85 treesize of output 85 [2022-03-15 19:43:57,874 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 64 treesize of output 52 [2022-03-15 19:43:57,876 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 52 treesize of output 46 [2022-03-15 19:43:58,008 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 1 not checked. [2022-03-15 19:43:58,008 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242345124] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:58,008 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:58,008 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 7] total 25 [2022-03-15 19:43:58,008 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1652326803] [2022-03-15 19:43:58,008 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:58,012 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:58,026 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 107 transitions. [2022-03-15 19:43:58,026 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:58,297 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:43:58,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:43:58,297 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:58,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:43:58,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=490, Unknown=2, NotChecked=90, Total=650 [2022-03-15 19:43:58,298 INFO L87 Difference]: Start difference. First operand 469 states and 1342 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:58,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:58,718 INFO L93 Difference]: Finished difference Result 702 states and 2008 transitions. [2022-03-15 19:43:58,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:43:58,719 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 19:43:58,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:58,721 INFO L225 Difference]: With dead ends: 702 [2022-03-15 19:43:58,721 INFO L226 Difference]: Without dead ends: 635 [2022-03-15 19:43:58,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=490, Unknown=2, NotChecked=90, Total=650 [2022-03-15 19:43:58,722 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 35 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:58,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 96 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:43:58,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2022-03-15 19:43:58,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 470. [2022-03-15 19:43:58,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 2.8656716417910446) internal successors, (1344), 469 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:58,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1344 transitions. [2022-03-15 19:43:58,734 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1344 transitions. Word has length 28 [2022-03-15 19:43:58,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:58,734 INFO L470 AbstractCegarLoop]: Abstraction has 470 states and 1344 transitions. [2022-03-15 19:43:58,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:58,734 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1344 transitions. [2022-03-15 19:43:58,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:43:58,735 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:58,735 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:58,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:58,951 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,SelfDestructingSolverStorable15 [2022-03-15 19:43:58,951 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:43:58,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:58,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1202049473, now seen corresponding path program 2 times [2022-03-15 19:43:58,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:58,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167326412] [2022-03-15 19:43:58,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:58,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:59,012 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 19:43:59,012 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:59,012 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167326412] [2022-03-15 19:43:59,013 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167326412] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:59,013 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468453777] [2022-03-15 19:43:59,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:43:59,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:59,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:59,014 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:59,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 19:43:59,160 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:43:59,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:59,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:43:59,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:59,213 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 19:43:59,214 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 19:43:59,214 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468453777] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:43:59,214 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 19:43:59,214 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-03-15 19:43:59,214 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [399738554] [2022-03-15 19:43:59,214 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:59,219 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:59,230 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 58 transitions. [2022-03-15 19:43:59,230 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:59,426 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:43:59,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:43:59,426 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:59,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:43:59,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:43:59,427 INFO L87 Difference]: Start difference. First operand 470 states and 1344 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:59,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:59,478 INFO L93 Difference]: Finished difference Result 708 states and 2111 transitions. [2022-03-15 19:43:59,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:43:59,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 19:43:59,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:59,480 INFO L225 Difference]: With dead ends: 708 [2022-03-15 19:43:59,480 INFO L226 Difference]: Without dead ends: 612 [2022-03-15 19:43:59,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:43:59,481 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 48 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:59,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 7 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:43:59,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2022-03-15 19:43:59,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 528. [2022-03-15 19:43:59,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 3.2163187855787476) internal successors, (1695), 527 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:59,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 1695 transitions. [2022-03-15 19:43:59,495 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 1695 transitions. Word has length 28 [2022-03-15 19:43:59,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:59,495 INFO L470 AbstractCegarLoop]: Abstraction has 528 states and 1695 transitions. [2022-03-15 19:43:59,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:59,495 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 1695 transitions. [2022-03-15 19:43:59,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:43:59,498 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:59,498 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:59,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-03-15 19:43:59,711 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,SelfDestructingSolverStorable16 [2022-03-15 19:43:59,711 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:43:59,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:59,712 INFO L85 PathProgramCache]: Analyzing trace with hash 771689613, now seen corresponding path program 11 times [2022-03-15 19:43:59,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:59,713 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836405740] [2022-03-15 19:43:59,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:59,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:00,412 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:44:00,413 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:00,413 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836405740] [2022-03-15 19:44:00,413 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836405740] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:00,413 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854846471] [2022-03-15 19:44:00,413 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:44:00,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:00,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:00,416 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:00,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 19:44:00,538 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:44:00,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:00,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 19:44:00,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:00,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:00,782 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:44:00,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:00,827 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:44:00,855 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:44:00,885 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:44:00,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:00,930 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_892 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_892) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) 0))) is different from false [2022-03-15 19:44:00,940 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_891 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_891) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_892) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) 0))) is different from false [2022-03-15 19:44:00,956 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:00,956 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 167 treesize of output 159 [2022-03-15 19:44:00,962 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 114 [2022-03-15 19:44:00,965 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 114 treesize of output 102 [2022-03-15 19:44:01,100 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 1 not checked. [2022-03-15 19:44:01,100 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854846471] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:01,100 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:01,100 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 7] total 27 [2022-03-15 19:44:01,100 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1729875002] [2022-03-15 19:44:01,100 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:01,106 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:01,126 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 108 transitions. [2022-03-15 19:44:01,126 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:01,340 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:44:01,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:44:01,340 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:01,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:44:01,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=582, Unknown=2, NotChecked=98, Total=756 [2022-03-15 19:44:01,341 INFO L87 Difference]: Start difference. First operand 528 states and 1695 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:02,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:02,394 INFO L93 Difference]: Finished difference Result 765 states and 2354 transitions. [2022-03-15 19:44:02,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 19:44:02,395 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 19:44:02,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:02,398 INFO L225 Difference]: With dead ends: 765 [2022-03-15 19:44:02,398 INFO L226 Difference]: Without dead ends: 698 [2022-03-15 19:44:02,398 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=128, Invalid=870, Unknown=2, NotChecked=122, Total=1122 [2022-03-15 19:44:02,399 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 34 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:02,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 76 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:44:02,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2022-03-15 19:44:02,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 529. [2022-03-15 19:44:02,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 3.2140151515151514) internal successors, (1697), 528 states have internal predecessors, (1697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:02,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1697 transitions. [2022-03-15 19:44:02,419 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1697 transitions. Word has length 29 [2022-03-15 19:44:02,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:02,420 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 1697 transitions. [2022-03-15 19:44:02,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:02,420 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1697 transitions. [2022-03-15 19:44:02,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:44:02,421 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:02,422 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:02,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-03-15 19:44:02,643 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,SelfDestructingSolverStorable17 [2022-03-15 19:44:02,643 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:44:02,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:02,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1014917963, now seen corresponding path program 1 times [2022-03-15 19:44:02,645 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:02,645 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42208309] [2022-03-15 19:44:02,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:02,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:02,955 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:44:02,955 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:02,955 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42208309] [2022-03-15 19:44:02,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42208309] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:02,955 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340424022] [2022-03-15 19:44:02,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:02,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:02,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:02,960 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:02,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 19:44:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:03,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 19:44:03,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:03,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:03,439 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:44:03,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:03,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:03,713 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-15 19:44:03,713 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 40 [2022-03-15 19:44:03,835 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:44:03,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:03,870 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_954 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_954) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 0))) is different from false [2022-03-15 19:44:03,917 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_954 (Array Int Int)) (~q2~0.offset Int)) (or (not (= (select (select |c_#memory_int| c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_back~0 4))) (select (select |c_#memory_int| c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_954) c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_front~0 4))) 0)))) is different from false [2022-03-15 19:44:03,940 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_954 (Array Int Int)) (~q2~0.offset Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_953))) (or (not (= (select (select .cse0 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (select (select .cse0 c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_back~0 4))))) (not (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_954) c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_front~0 4))) 0))))) is different from false [2022-03-15 19:44:04,017 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:04,017 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 269 treesize of output 321 [2022-03-15 19:44:04,039 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:04,039 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 209 treesize of output 221 [2022-03-15 19:44:04,045 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 102 [2022-03-15 19:44:05,156 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-03-15 19:44:05,156 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340424022] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:05,156 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:05,156 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 32 [2022-03-15 19:44:05,156 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1857093652] [2022-03-15 19:44:05,156 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:05,162 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:05,171 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 49 transitions. [2022-03-15 19:44:05,171 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:05,340 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [25837#(or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))] [2022-03-15 19:44:05,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:44:05,340 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:05,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:44:05,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=817, Unknown=3, NotChecked=180, Total=1122 [2022-03-15 19:44:05,341 INFO L87 Difference]: Start difference. First operand 529 states and 1697 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:06,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:06,070 INFO L93 Difference]: Finished difference Result 1213 states and 3872 transitions. [2022-03-15 19:44:06,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:44:06,071 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 19:44:06,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:06,076 INFO L225 Difference]: With dead ends: 1213 [2022-03-15 19:44:06,077 INFO L226 Difference]: Without dead ends: 1213 [2022-03-15 19:44:06,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=180, Invalid=1311, Unknown=3, NotChecked=228, Total=1722 [2022-03-15 19:44:06,078 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 148 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:06,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 38 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:44:06,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2022-03-15 19:44:06,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 907. [2022-03-15 19:44:06,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 906 states have (on average 3.272626931567329) internal successors, (2965), 906 states have internal predecessors, (2965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:06,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 2965 transitions. [2022-03-15 19:44:06,105 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 2965 transitions. Word has length 29 [2022-03-15 19:44:06,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:06,105 INFO L470 AbstractCegarLoop]: Abstraction has 907 states and 2965 transitions. [2022-03-15 19:44:06,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:06,105 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 2965 transitions. [2022-03-15 19:44:06,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:44:06,108 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:06,108 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:06,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:06,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:06,331 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:44:06,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:06,331 INFO L85 PathProgramCache]: Analyzing trace with hash 2062372287, now seen corresponding path program 2 times [2022-03-15 19:44:06,332 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:06,332 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621715714] [2022-03-15 19:44:06,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:06,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:06,615 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:44:06,616 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:06,616 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621715714] [2022-03-15 19:44:06,616 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621715714] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:06,616 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531125780] [2022-03-15 19:44:06,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:44:06,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:06,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:06,617 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:06,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 19:44:06,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:44:06,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:06,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 19:44:06,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:06,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:06,874 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:44:06,901 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 19:44:06,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:06,920 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1015 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1015) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 0))) is different from false [2022-03-15 19:44:06,931 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:06,931 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 44 treesize of output 44 [2022-03-15 19:44:06,933 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-03-15 19:44:07,048 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 1 not checked. [2022-03-15 19:44:07,049 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531125780] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:07,049 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:07,049 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 17 [2022-03-15 19:44:07,049 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [373894509] [2022-03-15 19:44:07,049 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:07,055 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:07,065 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 47 transitions. [2022-03-15 19:44:07,065 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:07,277 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:44:07,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:44:07,278 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:07,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:44:07,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=233, Unknown=1, NotChecked=30, Total=306 [2022-03-15 19:44:07,278 INFO L87 Difference]: Start difference. First operand 907 states and 2965 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:07,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:07,773 INFO L93 Difference]: Finished difference Result 1139 states and 3650 transitions. [2022-03-15 19:44:07,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:44:07,773 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 19:44:07,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:07,778 INFO L225 Difference]: With dead ends: 1139 [2022-03-15 19:44:07,778 INFO L226 Difference]: Without dead ends: 1107 [2022-03-15 19:44:07,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=466, Unknown=1, NotChecked=44, Total=600 [2022-03-15 19:44:07,779 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 118 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:07,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 39 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:44:07,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2022-03-15 19:44:07,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 907. [2022-03-15 19:44:07,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 906 states have (on average 3.2373068432671084) internal successors, (2933), 906 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:07,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 2933 transitions. [2022-03-15 19:44:07,803 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 2933 transitions. Word has length 29 [2022-03-15 19:44:07,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:07,803 INFO L470 AbstractCegarLoop]: Abstraction has 907 states and 2933 transitions. [2022-03-15 19:44:07,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:07,804 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 2933 transitions. [2022-03-15 19:44:07,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:44:07,806 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:07,806 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:07,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:08,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:08,031 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:44:08,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:08,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1091868167, now seen corresponding path program 12 times [2022-03-15 19:44:08,033 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:08,033 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551725997] [2022-03-15 19:44:08,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:08,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:09,198 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:44:09,198 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:09,198 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551725997] [2022-03-15 19:44:09,198 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551725997] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:09,198 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649012565] [2022-03-15 19:44:09,198 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:44:09,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:09,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:09,200 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:09,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 19:44:09,376 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:44:09,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:09,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:44:09,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:09,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:09,534 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:44:09,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:09,570 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:44:09,592 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:44:09,620 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-03-15 19:44:09,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:09,679 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1089 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1089) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) 0))) is different from false [2022-03-15 19:44:09,690 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1088 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1088) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1089) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) 0))) is different from false [2022-03-15 19:44:09,705 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:09,705 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 85 treesize of output 85 [2022-03-15 19:44:09,708 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 64 treesize of output 52 [2022-03-15 19:44:09,713 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2022-03-15 19:44:09,851 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 1 not checked. [2022-03-15 19:44:09,851 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649012565] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:09,851 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:09,851 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 24 [2022-03-15 19:44:09,851 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [749587756] [2022-03-15 19:44:09,851 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:09,857 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:09,873 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 109 transitions. [2022-03-15 19:44:09,874 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:10,081 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:44:10,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:44:10,081 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:10,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:44:10,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=452, Unknown=2, NotChecked=86, Total=600 [2022-03-15 19:44:10,082 INFO L87 Difference]: Start difference. First operand 907 states and 2933 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:11,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:11,615 INFO L93 Difference]: Finished difference Result 1301 states and 4050 transitions. [2022-03-15 19:44:11,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:44:11,615 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:44:11,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:11,623 INFO L225 Difference]: With dead ends: 1301 [2022-03-15 19:44:11,623 INFO L226 Difference]: Without dead ends: 1234 [2022-03-15 19:44:11,624 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=130, Invalid=746, Unknown=2, NotChecked=114, Total=992 [2022-03-15 19:44:11,624 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 36 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:11,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 84 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:44:11,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2022-03-15 19:44:11,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 908. [2022-03-15 19:44:11,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 907 states have (on average 3.2359426681367145) internal successors, (2935), 907 states have internal predecessors, (2935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:11,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 2935 transitions. [2022-03-15 19:44:11,645 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 2935 transitions. Word has length 30 [2022-03-15 19:44:11,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:11,645 INFO L470 AbstractCegarLoop]: Abstraction has 908 states and 2935 transitions. [2022-03-15 19:44:11,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:11,646 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 2935 transitions. [2022-03-15 19:44:11,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:44:11,648 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:11,648 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2022-03-15 19:44:11,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:11,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:11,872 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:44:11,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:11,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1354086765, now seen corresponding path program 3 times [2022-03-15 19:44:11,873 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:11,873 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354046065] [2022-03-15 19:44:11,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:11,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:12,322 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:44:12,322 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:12,322 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354046065] [2022-03-15 19:44:12,322 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354046065] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:12,322 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981486971] [2022-03-15 19:44:12,322 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:44:12,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:12,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:12,324 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:12,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 19:44:12,496 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:44:12,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:12,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:44:12,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:12,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:12,630 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:44:12,656 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:44:12,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:12,675 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1154 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1154) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 0))) is different from false [2022-03-15 19:44:12,690 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:12,690 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 44 treesize of output 44 [2022-03-15 19:44:12,692 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-03-15 19:44:12,836 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 2 not checked. [2022-03-15 19:44:12,836 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981486971] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:12,836 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:12,836 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 19 [2022-03-15 19:44:12,836 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1667834933] [2022-03-15 19:44:12,836 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:12,842 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:12,853 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 50 transitions. [2022-03-15 19:44:12,853 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:12,985 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [35558#(or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))] [2022-03-15 19:44:12,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:44:12,986 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:12,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:44:12,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=319, Unknown=1, NotChecked=36, Total=420 [2022-03-15 19:44:12,986 INFO L87 Difference]: Start difference. First operand 908 states and 2935 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:13,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:13,654 INFO L93 Difference]: Finished difference Result 1412 states and 4530 transitions. [2022-03-15 19:44:13,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 19:44:13,655 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:44:13,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:13,660 INFO L225 Difference]: With dead ends: 1412 [2022-03-15 19:44:13,660 INFO L226 Difference]: Without dead ends: 1412 [2022-03-15 19:44:13,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=139, Invalid=676, Unknown=1, NotChecked=54, Total=870 [2022-03-15 19:44:13,660 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 146 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:13,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 60 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:44:13,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2022-03-15 19:44:13,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1180. [2022-03-15 19:44:13,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 1179 states have (on average 3.2578456318914335) internal successors, (3841), 1179 states have internal predecessors, (3841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:13,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 3841 transitions. [2022-03-15 19:44:13,690 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 3841 transitions. Word has length 30 [2022-03-15 19:44:13,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:13,690 INFO L470 AbstractCegarLoop]: Abstraction has 1180 states and 3841 transitions. [2022-03-15 19:44:13,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:13,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 3841 transitions. [2022-03-15 19:44:13,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:44:13,693 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:13,693 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2022-03-15 19:44:13,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-03-15 19:44:13,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:13,915 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:44:13,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:13,916 INFO L85 PathProgramCache]: Analyzing trace with hash -306632441, now seen corresponding path program 4 times [2022-03-15 19:44:13,917 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:13,917 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841078466] [2022-03-15 19:44:13,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:13,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:15,227 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:15,227 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:15,227 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841078466] [2022-03-15 19:44:15,227 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841078466] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:15,227 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419721215] [2022-03-15 19:44:15,227 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:44:15,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:15,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:15,228 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:15,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 19:44:15,381 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:44:15,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:15,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:44:15,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:15,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:15,530 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:44:15,565 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:44:15,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:15,585 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1219 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1219) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 0))) is different from false [2022-03-15 19:44:15,599 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:15,600 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 44 [2022-03-15 19:44:15,602 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-03-15 19:44:15,752 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 1 not checked. [2022-03-15 19:44:15,752 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419721215] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:15,752 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:15,752 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 6] total 26 [2022-03-15 19:44:15,752 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1005902598] [2022-03-15 19:44:15,752 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:15,757 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:15,787 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 48 transitions. [2022-03-15 19:44:15,787 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:16,093 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:44:16,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:44:16,093 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:16,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:44:16,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=578, Unknown=1, NotChecked=48, Total=702 [2022-03-15 19:44:16,093 INFO L87 Difference]: Start difference. First operand 1180 states and 3841 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:16,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:16,809 INFO L93 Difference]: Finished difference Result 1450 states and 4659 transitions. [2022-03-15 19:44:16,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 19:44:16,810 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:44:16,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:16,816 INFO L225 Difference]: With dead ends: 1450 [2022-03-15 19:44:16,816 INFO L226 Difference]: Without dead ends: 1438 [2022-03-15 19:44:16,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=85, Invalid=674, Unknown=1, NotChecked=52, Total=812 [2022-03-15 19:44:16,817 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 70 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:16,817 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 111 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:44:16,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2022-03-15 19:44:16,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1235. [2022-03-15 19:44:16,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 1234 states have (on average 3.233387358184765) internal successors, (3990), 1234 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:16,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 3990 transitions. [2022-03-15 19:44:16,842 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 3990 transitions. Word has length 30 [2022-03-15 19:44:16,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:16,842 INFO L470 AbstractCegarLoop]: Abstraction has 1235 states and 3990 transitions. [2022-03-15 19:44:16,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:16,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 3990 transitions. [2022-03-15 19:44:16,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:44:16,846 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:16,846 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2022-03-15 19:44:16,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:17,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:17,070 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:44:17,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:17,070 INFO L85 PathProgramCache]: Analyzing trace with hash 952563985, now seen corresponding path program 5 times [2022-03-15 19:44:17,071 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:17,071 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236542520] [2022-03-15 19:44:17,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:17,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:17,460 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:17,460 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:17,460 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236542520] [2022-03-15 19:44:17,460 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236542520] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:17,460 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692547496] [2022-03-15 19:44:17,460 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:44:17,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:17,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:17,462 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:17,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 19:44:17,589 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:44:17,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:17,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 19:44:17,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:17,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:17,911 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:44:18,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:18,001 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:44:18,329 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:44:18,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:18,653 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:18,653 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1885 treesize of output 1713 [2022-03-15 19:44:18,681 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:18,682 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 1601 treesize of output 1445 [2022-03-15 19:44:18,727 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:18,728 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 1397 treesize of output 1037 [2022-03-15 19:44:21,730 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:44:21,730 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692547496] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:21,730 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:21,730 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 34 [2022-03-15 19:44:21,730 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [756764028] [2022-03-15 19:44:21,730 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:21,747 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:21,768 INFO L252 McrAutomatonBuilder]: Finished intersection with 77 states and 137 transitions. [2022-03-15 19:44:21,768 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:24,270 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [43685#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0) (<= ~n1~0 0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (<= ~q1_back~0 0) (< ~q2_back~0 0)) (or (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 0) (<= ~n1~0 0) (<= ~n2~0 ~q2_back~0) (<= ~q1_back~0 0) (= ~q2~0.offset 0) (< ~q2_back~0 0))), 43684#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~n1~0 0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~q1_back~0 0)) (or (<= ~n1~0 0) (<= ~q1_back~0 0) (= ~q2~0.offset 0))), 43683#(and (or (<= ~n1~0 0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~q1_back~0 0)) (or (<= ~n1~0 0) (<= ~q1_back~0 0) (= ~q2~0.offset 0)))] [2022-03-15 19:44:24,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:44:24,270 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:24,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:44:24,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1271, Unknown=4, NotChecked=0, Total=1406 [2022-03-15 19:44:24,271 INFO L87 Difference]: Start difference. First operand 1235 states and 3990 transitions. Second operand has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:24,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:24,704 INFO L93 Difference]: Finished difference Result 1782 states and 5778 transitions. [2022-03-15 19:44:24,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 19:44:24,705 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:44:24,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:24,711 INFO L225 Difference]: With dead ends: 1782 [2022-03-15 19:44:24,712 INFO L226 Difference]: Without dead ends: 1750 [2022-03-15 19:44:24,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=199, Invalid=1777, Unknown=4, NotChecked=0, Total=1980 [2022-03-15 19:44:24,713 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 160 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:24,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 40 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:44:24,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2022-03-15 19:44:24,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1202. [2022-03-15 19:44:24,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 1201 states have (on average 3.2439633638634473) internal successors, (3896), 1201 states have internal predecessors, (3896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:24,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 3896 transitions. [2022-03-15 19:44:24,741 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 3896 transitions. Word has length 30 [2022-03-15 19:44:24,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:24,741 INFO L470 AbstractCegarLoop]: Abstraction has 1202 states and 3896 transitions. [2022-03-15 19:44:24,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:24,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 3896 transitions. [2022-03-15 19:44:24,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:44:24,744 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:24,744 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2022-03-15 19:44:24,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:24,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:24,966 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:44:24,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:24,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1262131355, now seen corresponding path program 6 times [2022-03-15 19:44:24,967 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:24,967 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592991356] [2022-03-15 19:44:24,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:24,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:25,333 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:44:25,333 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:25,333 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592991356] [2022-03-15 19:44:25,333 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592991356] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:25,333 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426575840] [2022-03-15 19:44:25,334 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:44:25,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:25,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:25,335 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:25,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 19:44:25,468 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:44:25,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:25,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 19:44:25,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:25,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:25,670 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:44:25,747 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:44:25,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:25,783 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1350 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1350) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 0))) is different from false [2022-03-15 19:44:25,808 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:25,808 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 44 treesize of output 44 [2022-03-15 19:44:25,810 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-03-15 19:44:25,938 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 19:44:25,938 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426575840] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:25,939 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:25,939 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 6] total 20 [2022-03-15 19:44:25,939 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1938343489] [2022-03-15 19:44:25,939 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:25,944 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:25,961 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 92 transitions. [2022-03-15 19:44:25,961 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:26,563 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:44:26,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:44:26,564 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:26,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:44:26,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=327, Unknown=1, NotChecked=36, Total=420 [2022-03-15 19:44:26,564 INFO L87 Difference]: Start difference. First operand 1202 states and 3896 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:26,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:26,960 INFO L93 Difference]: Finished difference Result 1355 states and 4297 transitions. [2022-03-15 19:44:26,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:44:26,960 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:44:26,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:26,964 INFO L225 Difference]: With dead ends: 1355 [2022-03-15 19:44:26,964 INFO L226 Difference]: Without dead ends: 1323 [2022-03-15 19:44:26,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=537, Unknown=1, NotChecked=48, Total=702 [2022-03-15 19:44:26,965 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 123 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:26,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 36 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:44:26,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2022-03-15 19:44:26,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 910. [2022-03-15 19:44:26,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 909 states have (on average 3.233223322332233) internal successors, (2939), 909 states have internal predecessors, (2939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:27,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 2939 transitions. [2022-03-15 19:44:27,006 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 2939 transitions. Word has length 30 [2022-03-15 19:44:27,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:27,006 INFO L470 AbstractCegarLoop]: Abstraction has 910 states and 2939 transitions. [2022-03-15 19:44:27,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:27,007 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 2939 transitions. [2022-03-15 19:44:27,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:44:27,009 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:27,009 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:27,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:27,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-03-15 19:44:27,210 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:44:27,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:27,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1375540702, now seen corresponding path program 1 times [2022-03-15 19:44:27,212 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:27,212 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650045848] [2022-03-15 19:44:27,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:27,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:28,360 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:28,360 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:28,360 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650045848] [2022-03-15 19:44:28,360 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650045848] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:28,361 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691427740] [2022-03-15 19:44:28,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:28,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:28,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:28,362 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:28,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 19:44:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:28,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 77 conjunts are in the unsatisfiable core [2022-03-15 19:44:28,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:29,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:29,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:44:29,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:29,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:29,653 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-15 19:44:29,653 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 42 [2022-03-15 19:44:30,439 INFO L353 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-03-15 19:44:30,439 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 10 [2022-03-15 19:44:30,510 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:30,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:30,629 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1412 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1412) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))))) (or (= 0 .cse0) (let ((.cse1 (+ c_~t~0 .cse0))) (and (< .cse1 (+ c_~N~0 1)) (<= c_~N~0 .cse1)))))) is different from false [2022-03-15 19:44:31,252 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:31,252 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 601 treesize of output 621 [2022-03-15 19:44:31,288 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:31,288 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 445 treesize of output 433 [2022-03-15 19:44:31,317 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 403 treesize of output 331 [2022-03-15 19:44:37,066 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:37,067 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691427740] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:37,067 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:37,067 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 48 [2022-03-15 19:44:37,067 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1317316888] [2022-03-15 19:44:37,067 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:37,072 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:37,082 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 60 transitions. [2022-03-15 19:44:37,082 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:37,697 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [51493#(and (or (< (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4)) 0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (<= ~q2_back~0 (+ 1 ~q2_front~0))) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4)) 0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (<= ~q2_back~0 (+ 1 ~q2_front~0)) (<= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))), 51492#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~t~0 (+ ~N~0 1)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= ~N~0 ~t~0)))] [2022-03-15 19:44:37,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:44:37,697 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:37,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:44:37,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=2286, Unknown=5, NotChecked=98, Total=2652 [2022-03-15 19:44:37,698 INFO L87 Difference]: Start difference. First operand 910 states and 2939 transitions. Second operand has 21 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:39,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:39,169 INFO L93 Difference]: Finished difference Result 1129 states and 3525 transitions. [2022-03-15 19:44:39,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:44:39,170 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:44:39,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:39,172 INFO L225 Difference]: With dead ends: 1129 [2022-03-15 19:44:39,172 INFO L226 Difference]: Without dead ends: 1099 [2022-03-15 19:44:39,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=339, Invalid=2966, Unknown=5, NotChecked=112, Total=3422 [2022-03-15 19:44:39,174 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 88 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:39,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 149 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:44:39,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2022-03-15 19:44:39,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1084. [2022-03-15 19:44:39,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1083 states have (on average 3.1477377654662972) internal successors, (3409), 1083 states have internal predecessors, (3409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:39,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 3409 transitions. [2022-03-15 19:44:39,193 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 3409 transitions. Word has length 30 [2022-03-15 19:44:39,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:39,193 INFO L470 AbstractCegarLoop]: Abstraction has 1084 states and 3409 transitions. [2022-03-15 19:44:39,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:39,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 3409 transitions. [2022-03-15 19:44:39,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:44:39,195 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:39,195 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:39,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:39,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-15 19:44:39,411 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:44:39,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:39,412 INFO L85 PathProgramCache]: Analyzing trace with hash 432445674, now seen corresponding path program 2 times [2022-03-15 19:44:39,413 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:39,413 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772866346] [2022-03-15 19:44:39,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:39,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:41,016 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:41,017 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:41,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772866346] [2022-03-15 19:44:41,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772866346] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:41,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896506901] [2022-03-15 19:44:41,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:44:41,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:41,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:41,018 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:41,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 19:44:41,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:44:41,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:41,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 61 conjunts are in the unsatisfiable core [2022-03-15 19:44:41,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:41,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:41,617 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:44:41,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:41,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:41,854 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-15 19:44:41,854 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 42 [2022-03-15 19:44:41,981 INFO L353 Elim1Store]: treesize reduction 21, result has 4.5 percent of original size [2022-03-15 19:44:41,982 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 14 [2022-03-15 19:44:42,048 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:44:42,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:42,151 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1474 (Array Int Int))) (<= c_~N~0 (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1474) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4)))))) (forall ((v_ArrVal_1474 (Array Int Int))) (< (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1474) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (+ c_~N~0 1)))) is different from false [2022-03-15 19:44:42,385 WARN L838 $PredicateComparison]: unable to prove that (forall ((~q2~0.offset Int) (v_ArrVal_1473 (Array Int Int))) (or (not (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1473))) (= (select (select .cse0 c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_back~0 4))) (select (select .cse0 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset))))) (and (forall ((v_ArrVal_1474 (Array Int Int))) (< (+ c_~t~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1473) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1474) c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_front~0 4)))) (+ c_~N~0 1))) (forall ((v_ArrVal_1474 (Array Int Int))) (<= c_~N~0 (+ c_~t~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1473) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1474) c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_front~0 4))))))))) is different from false [2022-03-15 19:44:42,520 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:42,520 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 276 treesize of output 328 [2022-03-15 19:44:42,540 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:42,541 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 328 treesize of output 340 [2022-03-15 19:44:42,557 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 133 treesize of output 121 [2022-03-15 19:44:42,566 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 121 treesize of output 109 [2022-03-15 19:44:44,035 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2022-03-15 19:44:44,036 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896506901] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:44,036 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:44,036 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 11] total 41 [2022-03-15 19:44:44,036 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [597748850] [2022-03-15 19:44:44,036 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:44,040 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:44,052 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 58 transitions. [2022-03-15 19:44:44,052 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:44,713 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [55022#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~t~0 (+ ~N~0 1)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= ~N~0 ~t~0)))] [2022-03-15 19:44:44,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:44:44,713 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:44,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:44:44,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1579, Unknown=8, NotChecked=162, Total=1892 [2022-03-15 19:44:44,714 INFO L87 Difference]: Start difference. First operand 1084 states and 3409 transitions. Second operand has 21 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:47,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:47,117 INFO L93 Difference]: Finished difference Result 1475 states and 4673 transitions. [2022-03-15 19:44:47,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 19:44:47,117 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:44:47,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:47,121 INFO L225 Difference]: With dead ends: 1475 [2022-03-15 19:44:47,121 INFO L226 Difference]: Without dead ends: 1454 [2022-03-15 19:44:47,121 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 41 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=198, Invalid=2352, Unknown=8, NotChecked=198, Total=2756 [2022-03-15 19:44:47,122 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 79 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:47,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 195 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1433 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 19:44:47,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2022-03-15 19:44:47,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1042. [2022-03-15 19:44:47,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 1041 states have (on average 3.152737752161383) internal successors, (3282), 1041 states have internal predecessors, (3282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:47,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 3282 transitions. [2022-03-15 19:44:47,144 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 3282 transitions. Word has length 30 [2022-03-15 19:44:47,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:47,144 INFO L470 AbstractCegarLoop]: Abstraction has 1042 states and 3282 transitions. [2022-03-15 19:44:47,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:47,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 3282 transitions. [2022-03-15 19:44:47,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:44:47,147 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:47,147 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:47,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-03-15 19:44:47,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-15 19:44:47,365 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:44:47,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:47,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1545594136, now seen corresponding path program 3 times [2022-03-15 19:44:47,366 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:47,366 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713005251] [2022-03-15 19:44:47,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:47,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:48,574 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:48,574 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:48,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713005251] [2022-03-15 19:44:48,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713005251] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:48,575 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366822550] [2022-03-15 19:44:48,575 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:44:48,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:48,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:48,576 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:48,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-15 19:44:48,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:44:48,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:48,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 63 conjunts are in the unsatisfiable core [2022-03-15 19:44:48,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:49,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:49,140 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:44:49,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:44:49,220 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:44:49,557 INFO L353 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-03-15 19:44:49,557 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 44 treesize of output 10 [2022-03-15 19:44:49,622 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:44:49,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:50,230 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:50,231 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1028 treesize of output 984 [2022-03-15 19:44:50,256 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:50,256 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 872 treesize of output 812 [2022-03-15 19:44:50,280 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:44:50,280 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 764 treesize of output 596 [2022-03-15 19:44:56,734 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:44:56,734 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366822550] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:56,734 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:56,735 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 14] total 45 [2022-03-15 19:44:56,735 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1942028364] [2022-03-15 19:44:56,735 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:56,739 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:56,801 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 157 transitions. [2022-03-15 19:44:56,801 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:13,168 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [58824#(and (or (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 (+ ~q1_front~0 1)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) (<= ~n2~0 (+ ~q2_back~0 1)) (<= ~q1_back~0 (+ ~q1_front~0 1)) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (< ~q2_back~0 0)) (or (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 (+ ~q1_front~0 1)) (<= 1 ~N~0) (<= ~n2~0 (+ ~q2_back~0 1)) (<= ~q1_back~0 (+ ~q1_front~0 1)) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (< ~q2_back~0 0)) (or (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 (+ ~q1_front~0 1)) (<= ~n2~0 (+ ~q2_back~0 1)) (<= ~q1_back~0 (+ ~q1_front~0 1)) (<= ~N~0 1) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (< ~q2_back~0 0)) (or (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 (+ ~q1_front~0 1)) (<= ~n2~0 (+ ~q2_back~0 1)) (<= ~q1_back~0 (+ ~q1_front~0 1)) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (< ~q2_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (or (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 (+ ~q1_front~0 1)) (<= ~n2~0 (+ ~q2_back~0 1)) (<= ~q1_back~0 (+ ~q1_front~0 1)) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (<= ~q2_front~0 0) (< ~q2_back~0 0)) (or (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 (+ ~q1_front~0 1)) (= ~t~0 0) (<= ~n2~0 (+ ~q2_back~0 1)) (<= ~q1_back~0 (+ ~q1_front~0 1)) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (< ~q2_back~0 0)) (or (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 (+ ~q1_front~0 1)) (<= ~n2~0 (+ ~q2_back~0 1)) (<= ~q1_back~0 (+ ~q1_front~0 1)) (= ~q2~0.offset 0) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (< ~q2_back~0 0))), 58825#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~t~0 (+ ~N~0 1)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= ~N~0 ~t~0))), 58826#(and (or (< (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4)) 0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (<= ~q2_back~0 (+ 1 ~q2_front~0))) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4)) 0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (<= ~q2_back~0 (+ 1 ~q2_front~0)) (<= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))), 58821#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~N~0 1) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (< ~q2_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (= ~t~0 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= 1 ~N~0) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (= ~q2~0.offset 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~q2_front~0 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) (< ~q2_back~0 0))), 58822#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (< ~q2_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (<= ~N~0 1) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= ~q2~0.offset 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= 1 ~N~0) (<= ~n2~0 ~q2_back~0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (<= ~q2_front~0 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 58823#(and (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= ~q2~0.offset 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= ~t~0 0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q2_front~0 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~N~0 1) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))] [2022-03-15 19:45:13,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 19:45:13,169 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:13,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 19:45:13,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=2447, Unknown=9, NotChecked=0, Total=2756 [2022-03-15 19:45:13,170 INFO L87 Difference]: Start difference. First operand 1042 states and 3282 transitions. Second operand has 25 states, 24 states have (on average 2.875) internal successors, (69), 24 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:19,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:19,919 INFO L93 Difference]: Finished difference Result 2005 states and 6260 transitions. [2022-03-15 19:45:19,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 19:45:19,920 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.875) internal successors, (69), 24 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:45:19,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:19,924 INFO L225 Difference]: With dead ends: 2005 [2022-03-15 19:45:19,924 INFO L226 Difference]: Without dead ends: 1915 [2022-03-15 19:45:19,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=593, Invalid=4948, Unknown=9, NotChecked=0, Total=5550 [2022-03-15 19:45:19,925 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 202 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 2218 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 2329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 2218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:19,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 285 Invalid, 2329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 2218 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 19:45:19,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2022-03-15 19:45:19,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1383. [2022-03-15 19:45:19,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 1382 states have (on average 3.240231548480463) internal successors, (4478), 1382 states have internal predecessors, (4478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:19,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 4478 transitions. [2022-03-15 19:45:19,946 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 4478 transitions. Word has length 30 [2022-03-15 19:45:19,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:19,947 INFO L470 AbstractCegarLoop]: Abstraction has 1383 states and 4478 transitions. [2022-03-15 19:45:19,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.875) internal successors, (69), 24 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:19,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 4478 transitions. [2022-03-15 19:45:19,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:45:19,950 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:19,950 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:19,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-03-15 19:45:20,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:20,167 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:45:20,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:20,168 INFO L85 PathProgramCache]: Analyzing trace with hash 812829216, now seen corresponding path program 4 times [2022-03-15 19:45:20,169 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:20,169 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194383854] [2022-03-15 19:45:20,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:20,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:21,325 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:21,325 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:21,325 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194383854] [2022-03-15 19:45:21,325 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194383854] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:21,325 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037600747] [2022-03-15 19:45:21,326 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:45:21,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:21,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:21,327 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:45:21,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-15 19:45:21,472 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:45:21,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:21,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-15 19:45:21,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:21,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:45:21,486 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 26 treesize of output 24 [2022-03-15 19:45:21,862 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:45:21,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:45:21,945 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:45:22,215 INFO L353 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-03-15 19:45:22,215 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 54 treesize of output 14 [2022-03-15 19:45:22,324 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:45:22,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:23,029 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:45:23,030 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2217 treesize of output 2013 [2022-03-15 19:45:23,071 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:45:23,071 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 1901 treesize of output 1493 [2022-03-15 19:45:23,109 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:45:23,110 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 1445 treesize of output 1265 [2022-03-15 19:45:26,348 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:45:26,349 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037600747] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:26,349 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:26,349 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 44 [2022-03-15 19:45:26,349 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2051501853] [2022-03-15 19:45:26,349 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:26,353 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:26,428 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 147 transitions. [2022-03-15 19:45:26,428 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:36,789 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [63862#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= ~q2~0.offset 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~N~0 ~t~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~t~0 ~N~0))), 63865#(and (or (< ~q1_front~0 0) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n1~0 (+ ~q1_front~0 1)) (<= ~n2~0 ~q2_back~0) (<= ~q1_back~0 (+ ~q1_front~0 1)) (< ~q2_back~0 0)) (or (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n1~0 (+ ~q1_front~0 1)) (<= ~n2~0 ~q2_back~0) (<= ~q1_back~0 (+ ~q1_front~0 1)) (<= ~N~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (< ~q2_back~0 0)) (or (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n1~0 (+ ~q1_front~0 1)) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (<= ~q1_back~0 (+ ~q1_front~0 1)) (< ~q2_back~0 0)) (or (< ~q1_front~0 0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n1~0 (+ ~q1_front~0 1)) (<= ~n2~0 ~q2_back~0) (<= ~q1_back~0 (+ ~q1_front~0 1)) (< ~q2_back~0 0)) (or (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 (+ ~q1_front~0 1)) (<= ~n2~0 ~q2_back~0) (<= ~q1_back~0 (+ ~q1_front~0 1)) (= ~q2~0.offset 0) (< ~q2_back~0 0)) (or (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n1~0 (+ ~q1_front~0 1)) (<= ~n2~0 ~q2_back~0) (<= ~q1_back~0 (+ ~q1_front~0 1)) (< ~q2_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))), 63866#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (+ ~N~0 1)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))), 63864#(and (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~N~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (= ~q2~0.offset 0) (< ~q2_back~0 0))), 63863#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= ~q2~0.offset 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4)))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4)))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~N~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (= ~t~0 0)))] [2022-03-15 19:45:36,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 19:45:36,790 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:36,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 19:45:36,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=2277, Unknown=9, NotChecked=0, Total=2550 [2022-03-15 19:45:36,791 INFO L87 Difference]: Start difference. First operand 1383 states and 4478 transitions. Second operand has 24 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:38,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:38,796 INFO L93 Difference]: Finished difference Result 1606 states and 5022 transitions. [2022-03-15 19:45:38,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 19:45:38,797 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:45:38,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:38,801 INFO L225 Difference]: With dead ends: 1606 [2022-03-15 19:45:38,801 INFO L226 Difference]: Without dead ends: 1593 [2022-03-15 19:45:38,802 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 68 SyntacticMatches, 10 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=345, Invalid=3186, Unknown=9, NotChecked=0, Total=3540 [2022-03-15 19:45:38,803 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 102 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:38,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 146 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:45:38,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2022-03-15 19:45:38,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1338. [2022-03-15 19:45:38,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1338 states, 1337 states have (on average 3.261780104712042) internal successors, (4361), 1337 states have internal predecessors, (4361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:38,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 4361 transitions. [2022-03-15 19:45:38,831 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 4361 transitions. Word has length 30 [2022-03-15 19:45:38,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:38,832 INFO L470 AbstractCegarLoop]: Abstraction has 1338 states and 4361 transitions. [2022-03-15 19:45:38,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:38,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 4361 transitions. [2022-03-15 19:45:38,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:45:38,835 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:38,835 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:38,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-15 19:45:39,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 19:45:39,055 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:45:39,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:39,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1609515332, now seen corresponding path program 5 times [2022-03-15 19:45:39,057 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:39,057 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579813249] [2022-03-15 19:45:39,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:39,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:40,303 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:40,304 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:40,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579813249] [2022-03-15 19:45:40,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579813249] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:40,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368838905] [2022-03-15 19:45:40,304 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:45:40,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:40,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:40,305 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:45:40,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-15 19:45:40,450 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:45:40,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:40,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 76 conjunts are in the unsatisfiable core [2022-03-15 19:45:40,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:40,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:45:40,999 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:45:41,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:45:41,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:45:41,346 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-15 19:45:41,346 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 41 [2022-03-15 19:45:41,780 INFO L353 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-03-15 19:45:41,780 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 10 [2022-03-15 19:45:41,850 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:41,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:42,375 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~q2_back~0 1)) (.cse0 (select (select |c_#memory_int| c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))) (or (not (= (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset)) .cse0)) (not (<= 0 .cse1)) (not (<= 0 c_~q1_back~0)) (not (< c_~q1_back~0 c_~n1~0)) (and (forall ((v_ArrVal_1663 (Array Int Int))) (< (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1663) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (+ c_~N~0 1))) (forall ((v_ArrVal_1663 (Array Int Int))) (<= c_~N~0 (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1663) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))))))) (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (<= c_~n2~0 c_~q2_front~0) (< c_~q2_front~0 0) (not (< .cse1 c_~n2~0)) (= .cse0 0))) is different from false [2022-03-15 19:45:42,628 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:45:42,628 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 305 treesize of output 349 [2022-03-15 19:45:42,650 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:45:42,650 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 349 treesize of output 355 [2022-03-15 19:45:42,664 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 133 treesize of output 121 [2022-03-15 19:45:42,673 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 121 treesize of output 109 [2022-03-15 19:45:49,207 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-15 19:45:49,207 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368838905] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:49,207 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:49,207 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 49 [2022-03-15 19:45:49,207 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [69096115] [2022-03-15 19:45:49,207 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:49,232 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:49,253 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 107 transitions. [2022-03-15 19:45:49,253 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:56,170 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [68392#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~N~0 1) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (= ~t~0 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= 1 ~N~0) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (<= 0 ~q2_front~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (= ~q2~0.offset 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~q2_front~0 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) (< ~q2_back~0 0))), 68394#(and (or (< (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4)) 0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (<= ~q2_back~0 (+ 1 ~q2_front~0))) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4)) 0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (<= ~q2_back~0 (+ 1 ~q2_front~0)) (<= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))), 68395#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (<= 0 ~q2_front~0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (<= ~N~0 1) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= ~q2~0.offset 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= 1 ~N~0) (<= ~n2~0 ~q2_back~0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (<= ~q2_front~0 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 68393#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~t~0 (+ ~N~0 1)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= ~N~0 ~t~0))), 68396#(and (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 1) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (= ~q2~0.offset 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= 1 ~N~0) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n2~0 ~q2_back~0) (<= 0 ~q2_front~0) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (<= ~q2_front~0 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))] [2022-03-15 19:45:56,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 19:45:56,171 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:56,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 19:45:56,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=2634, Unknown=21, NotChecked=106, Total=3080 [2022-03-15 19:45:56,172 INFO L87 Difference]: Start difference. First operand 1338 states and 4361 transitions. Second operand has 25 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 24 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:59,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:59,720 INFO L93 Difference]: Finished difference Result 2269 states and 7499 transitions. [2022-03-15 19:45:59,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 19:45:59,721 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 24 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:45:59,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:59,727 INFO L225 Difference]: With dead ends: 2269 [2022-03-15 19:45:59,727 INFO L226 Difference]: Without dead ends: 2207 [2022-03-15 19:45:59,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=479, Invalid=4334, Unknown=21, NotChecked=136, Total=4970 [2022-03-15 19:45:59,729 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 146 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 1850 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 1917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:59,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 210 Invalid, 1917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1850 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 19:45:59,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2207 states. [2022-03-15 19:45:59,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2207 to 1404. [2022-03-15 19:45:59,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 1403 states have (on average 3.2893799002138273) internal successors, (4615), 1403 states have internal predecessors, (4615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:59,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 4615 transitions. [2022-03-15 19:45:59,760 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 4615 transitions. Word has length 30 [2022-03-15 19:45:59,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:59,761 INFO L470 AbstractCegarLoop]: Abstraction has 1404 states and 4615 transitions. [2022-03-15 19:45:59,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 24 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:59,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 4615 transitions. [2022-03-15 19:45:59,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:45:59,764 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:59,764 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:59,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-15 19:45:59,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:59,979 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:45:59,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:59,980 INFO L85 PathProgramCache]: Analyzing trace with hash 876750412, now seen corresponding path program 6 times [2022-03-15 19:45:59,981 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:59,981 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403085170] [2022-03-15 19:45:59,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:59,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:01,380 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:01,381 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:01,381 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403085170] [2022-03-15 19:46:01,381 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403085170] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:01,381 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740925917] [2022-03-15 19:46:01,381 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:46:01,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:01,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:01,382 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:01,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-15 19:46:01,530 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 19:46:01,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:01,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 77 conjunts are in the unsatisfiable core [2022-03-15 19:46:01,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:01,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:46:01,570 INFO L353 Elim1Store]: treesize reduction 63, result has 32.3 percent of original size [2022-03-15 19:46:01,570 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 15 treesize of output 35 [2022-03-15 19:46:01,685 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-15 19:46:01,686 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-03-15 19:46:02,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:46:02,009 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 18 treesize of output 20 [2022-03-15 19:46:02,275 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-15 19:46:02,275 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 46 [2022-03-15 19:46:02,296 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 15 [2022-03-15 19:46:02,554 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-03-15 19:46:02,686 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:46:02,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:03,415 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:46:03,416 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 601 treesize of output 621 [2022-03-15 19:46:03,442 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:46:03,443 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 445 treesize of output 433 [2022-03-15 19:46:03,452 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 403 treesize of output 331 [2022-03-15 19:46:07,080 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:46:07,080 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740925917] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:07,080 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:07,081 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 14] total 45 [2022-03-15 19:46:07,081 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1911631805] [2022-03-15 19:46:07,081 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:07,085 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:07,102 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 102 transitions. [2022-03-15 19:46:07,102 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:11,439 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [73726#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= ~q2~0.offset 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4)))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4)))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~N~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (= ~t~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4)))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= 0 ~q2_front~0))), 73725#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= ~q2~0.offset 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~N~0 ~t~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4)))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~t~0 ~N~0))), 73728#(and (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (= ~t~0 0) (<= ~n1~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= 0 ~q2_front~0) (<= ~n1~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (= ~q2~0.offset 0))), 73729#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~t~0 (+ ~N~0 1)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= ~N~0 ~t~0))), 73727#(and (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~t~0 ~N~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~t~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (= ~q2~0.offset 0)))] [2022-03-15 19:46:11,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 19:46:11,439 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:11,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 19:46:11,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=2403, Unknown=5, NotChecked=0, Total=2652 [2022-03-15 19:46:11,441 INFO L87 Difference]: Start difference. First operand 1404 states and 4615 transitions. Second operand has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:14,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:14,396 INFO L93 Difference]: Finished difference Result 1872 states and 5865 transitions. [2022-03-15 19:46:14,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 19:46:14,397 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:46:14,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:14,402 INFO L225 Difference]: With dead ends: 1872 [2022-03-15 19:46:14,402 INFO L226 Difference]: Without dead ends: 1847 [2022-03-15 19:46:14,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 49 SyntacticMatches, 9 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=360, Invalid=4057, Unknown=5, NotChecked=0, Total=4422 [2022-03-15 19:46:14,403 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 105 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 1691 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 1755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:14,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 195 Invalid, 1755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1691 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 19:46:14,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2022-03-15 19:46:14,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1404. [2022-03-15 19:46:14,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 1403 states have (on average 3.2822523164647186) internal successors, (4605), 1403 states have internal predecessors, (4605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:14,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 4605 transitions. [2022-03-15 19:46:14,432 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 4605 transitions. Word has length 30 [2022-03-15 19:46:14,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:14,432 INFO L470 AbstractCegarLoop]: Abstraction has 1404 states and 4605 transitions. [2022-03-15 19:46:14,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:14,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 4605 transitions. [2022-03-15 19:46:14,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:46:14,435 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:14,435 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:14,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-15 19:46:14,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-03-15 19:46:14,659 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:46:14,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:14,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1241257864, now seen corresponding path program 7 times [2022-03-15 19:46:14,660 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:14,660 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527298368] [2022-03-15 19:46:14,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:14,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:14,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:15,871 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:15,872 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:15,872 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527298368] [2022-03-15 19:46:15,872 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527298368] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:15,872 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926647152] [2022-03-15 19:46:15,872 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:46:15,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:15,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:15,874 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:15,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-15 19:46:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:16,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 63 conjunts are in the unsatisfiable core [2022-03-15 19:46:16,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:16,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:46:16,375 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:46:16,460 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-03-15 19:46:16,660 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-03-15 19:46:16,721 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:46:16,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:16,820 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:46:16,820 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 34 [2022-03-15 19:46:17,019 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~n1~0 c_~q1_back~0) (and (forall ((v_ArrVal_1790 (Array Int Int))) (< (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1790) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (+ c_~N~0 1))) (forall ((v_ArrVal_1790 (Array Int Int))) (<= c_~N~0 (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1790) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset))))) (forall ((~q2~0.offset Int)) (= (+ ~q2~0.offset (* c_~q2_back~0 4)) (+ ~q2~0.offset (* c_~q2_front~0 4))))) (< c_~q1_back~0 0) (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0)) is different from false [2022-03-15 19:46:17,037 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:46:17,037 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 97 treesize of output 89 [2022-03-15 19:46:17,040 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 68 treesize of output 62 [2022-03-15 19:46:17,043 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 62 treesize of output 56 [2022-03-15 19:46:17,491 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:46:17,492 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926647152] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:17,492 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:17,492 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 11] total 39 [2022-03-15 19:46:17,492 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [614973706] [2022-03-15 19:46:17,492 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:17,495 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:17,520 INFO L252 McrAutomatonBuilder]: Finished intersection with 79 states and 141 transitions. [2022-03-15 19:46:17,520 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:30,998 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [78655#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~N~0 1) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (< ~q2_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (= ~t~0 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= 1 ~N~0) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (= ~q2~0.offset 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~q2_front~0 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) (< ~q2_back~0 0))), 78662#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 1) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (= ~q2~0.offset 0) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (= ~t~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= 1 ~N~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), 78660#(and (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 1) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (= ~q2~0.offset 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= 1 ~N~0) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (<= ~q2_front~0 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 78656#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~t~0 (+ ~N~0 1)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= ~N~0 ~t~0))), 78657#(and (or (< (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4)) 0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (<= ~q2_back~0 (+ 1 ~q2_front~0))) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4)) 0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (<= ~q2_back~0 (+ 1 ~q2_front~0)) (<= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))), 78661#(and (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~N~0 1) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= ~q2~0.offset 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= 1 ~N~0) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q2_front~0 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (= ~t~0 0) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 78658#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (< ~q2_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (<= ~N~0 1) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= ~q2~0.offset 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= 1 ~N~0) (<= ~n2~0 ~q2_back~0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (<= ~q2_front~0 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 78659#(and (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= ~q2~0.offset 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= ~t~0 0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q2_front~0 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~N~0 1) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))] [2022-03-15 19:46:30,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 19:46:30,998 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:30,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 19:46:30,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=2027, Unknown=1, NotChecked=92, Total=2352 [2022-03-15 19:46:30,999 INFO L87 Difference]: Start difference. First operand 1404 states and 4605 transitions. Second operand has 27 states, 26 states have (on average 2.769230769230769) internal successors, (72), 26 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:38,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:38,876 INFO L93 Difference]: Finished difference Result 2500 states and 7869 transitions. [2022-03-15 19:46:38,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 19:46:38,876 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.769230769230769) internal successors, (72), 26 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:46:38,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:38,881 INFO L225 Difference]: With dead ends: 2500 [2022-03-15 19:46:38,881 INFO L226 Difference]: Without dead ends: 2493 [2022-03-15 19:46:38,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 995 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=548, Invalid=5005, Unknown=1, NotChecked=146, Total=5700 [2022-03-15 19:46:38,882 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 234 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 2466 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 2548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 2466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:38,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 330 Invalid, 2548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 2466 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 19:46:38,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2022-03-15 19:46:38,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 1432. [2022-03-15 19:46:38,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1431 states have (on average 3.2669461914744935) internal successors, (4675), 1431 states have internal predecessors, (4675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:38,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 4675 transitions. [2022-03-15 19:46:38,913 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 4675 transitions. Word has length 30 [2022-03-15 19:46:38,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:38,913 INFO L470 AbstractCegarLoop]: Abstraction has 1432 states and 4675 transitions. [2022-03-15 19:46:38,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.769230769230769) internal successors, (72), 26 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:38,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 4675 transitions. [2022-03-15 19:46:38,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:46:38,916 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:38,916 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:38,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-03-15 19:46:39,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:39,116 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:46:39,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:39,117 INFO L85 PathProgramCache]: Analyzing trace with hash 508492944, now seen corresponding path program 8 times [2022-03-15 19:46:39,117 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:39,118 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99389800] [2022-03-15 19:46:39,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:39,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:40,179 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:40,180 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:40,180 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99389800] [2022-03-15 19:46:40,180 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99389800] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:40,180 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310645819] [2022-03-15 19:46:40,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:46:40,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:40,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:40,181 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:40,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-15 19:46:40,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:46:40,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:40,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 60 conjunts are in the unsatisfiable core [2022-03-15 19:46:40,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:40,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:46:40,670 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:46:40,755 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:46:40,937 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-03-15 19:46:41,009 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:46:41,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:41,108 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:46:41,108 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 34 [2022-03-15 19:46:41,310 WARN L838 $PredicateComparison]: unable to prove that (or (not (<= 0 c_~q1_back~0)) (not (< c_~q1_back~0 c_~n1~0)) (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (and (forall ((v_ArrVal_1851 (Array Int Int))) (<= c_~N~0 (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1851) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset))))) (forall ((v_ArrVal_1851 (Array Int Int))) (< (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1851) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (+ c_~N~0 1))) (forall ((~q2~0.offset Int)) (= (+ ~q2~0.offset (* c_~q2_back~0 4)) (+ ~q2~0.offset (* c_~q2_front~0 4)))))) is different from false [2022-03-15 19:46:41,334 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:46:41,334 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 97 treesize of output 89 [2022-03-15 19:46:41,337 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 68 treesize of output 62 [2022-03-15 19:46:41,340 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 62 treesize of output 56 [2022-03-15 19:46:41,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:46:41,774 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310645819] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:41,774 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:41,774 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 11] total 39 [2022-03-15 19:46:41,774 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1377830952] [2022-03-15 19:46:41,774 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:41,777 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:41,797 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 136 transitions. [2022-03-15 19:46:41,798 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:49,916 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [84299#(and (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~t~0 ~N~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~t~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (= ~q2~0.offset 0))), 84298#(and (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~N~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (= ~q2~0.offset 0) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (<= 0 ~q2_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0))), 84300#(and (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (= ~t~0 0) (<= ~n1~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= 0 ~q2_front~0) (<= ~n1~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (= ~q2~0.offset 0))), 84303#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (+ ~N~0 1)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))), 84296#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= ~q2~0.offset 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~N~0 ~t~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~t~0 ~N~0))), 84297#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= ~q2~0.offset 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4)))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4)))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~N~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (= ~t~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= 0 ~q2_front~0))), 84301#(and (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (= ~q2~0.offset 0) (< ~q2_back~0 0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (<= 0 ~q2_front~0) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~N~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (< ~q2_back~0 0))), 84302#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (<= ~N~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= 0 ~q2_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (= ~t~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (= ~q2~0.offset 0) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (= ~q1~0.offset 0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)))] [2022-03-15 19:46:49,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 19:46:49,917 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:49,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 19:46:49,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2045, Unknown=1, NotChecked=92, Total=2352 [2022-03-15 19:46:49,917 INFO L87 Difference]: Start difference. First operand 1432 states and 4675 transitions. Second operand has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:53,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:53,675 INFO L93 Difference]: Finished difference Result 2000 states and 6129 transitions. [2022-03-15 19:46:53,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 19:46:53,676 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:46:53,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:53,679 INFO L225 Difference]: With dead ends: 2000 [2022-03-15 19:46:53,679 INFO L226 Difference]: Without dead ends: 1979 [2022-03-15 19:46:53,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 64 SyntacticMatches, 9 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=375, Invalid=4050, Unknown=1, NotChecked=130, Total=4556 [2022-03-15 19:46:53,680 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 154 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 1831 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 1898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:53,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 198 Invalid, 1898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1831 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 19:46:53,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2022-03-15 19:46:53,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1414. [2022-03-15 19:46:53,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1414 states, 1413 states have (on average 3.2745930644019814) internal successors, (4627), 1413 states have internal predecessors, (4627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:53,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 4627 transitions. [2022-03-15 19:46:53,701 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 4627 transitions. Word has length 30 [2022-03-15 19:46:53,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:53,701 INFO L470 AbstractCegarLoop]: Abstraction has 1414 states and 4627 transitions. [2022-03-15 19:46:53,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:53,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 4627 transitions. [2022-03-15 19:46:53,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:46:53,704 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:53,704 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:53,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-03-15 19:46:53,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:53,905 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:46:53,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:53,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1591382784, now seen corresponding path program 9 times [2022-03-15 19:46:53,907 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:53,907 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038629061] [2022-03-15 19:46:53,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:53,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:55,151 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:55,152 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:55,152 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038629061] [2022-03-15 19:46:55,152 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038629061] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:55,152 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512249047] [2022-03-15 19:46:55,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:46:55,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:55,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:55,153 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:55,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-03-15 19:46:55,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:46:55,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:55,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 82 conjunts are in the unsatisfiable core [2022-03-15 19:46:55,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:56,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:46:56,008 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:46:56,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:46:56,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:46:56,597 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-15 19:46:56,597 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 42 [2022-03-15 19:46:57,426 INFO L353 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-03-15 19:46:57,427 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 44 treesize of output 10 [2022-03-15 19:46:57,527 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:57,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:58,557 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:46:58,557 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 630 treesize of output 642 [2022-03-15 19:46:58,583 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:46:58,584 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 458 treesize of output 440 [2022-03-15 19:46:58,594 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 403 treesize of output 331 [2022-03-15 19:47:02,982 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:02,982 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512249047] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:47:02,983 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:47:02,983 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 51 [2022-03-15 19:47:02,983 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1626189956] [2022-03-15 19:47:02,983 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:02,985 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:02,996 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 62 transitions. [2022-03-15 19:47:02,996 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:03,945 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [89398#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~t~0 (+ ~N~0 1)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= ~N~0 ~t~0))), 89397#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= 1 ~N~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (< 0 (+ 1 ~q2_front~0)) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (= ~t~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (= ~q2~0.offset 0) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 1) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) (< ~q1_back~0 0))), 89399#(and (or (< (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4)) 0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (<= ~q2_back~0 (+ 1 ~q2_front~0))) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4)) 0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (<= ~q2_back~0 (+ 1 ~q2_front~0)) (<= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))))] [2022-03-15 19:47:03,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:47:03,945 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:03,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:47:03,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=2743, Unknown=7, NotChecked=0, Total=3080 [2022-03-15 19:47:03,946 INFO L87 Difference]: Start difference. First operand 1414 states and 4627 transitions. Second operand has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:05,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:05,359 INFO L93 Difference]: Finished difference Result 1580 states and 5015 transitions. [2022-03-15 19:47:05,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:47:05,359 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:47:05,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:05,362 INFO L225 Difference]: With dead ends: 1580 [2022-03-15 19:47:05,362 INFO L226 Difference]: Without dead ends: 1573 [2022-03-15 19:47:05,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 896 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=370, Invalid=3283, Unknown=7, NotChecked=0, Total=3660 [2022-03-15 19:47:05,363 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 94 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:05,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 156 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1231 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:47:05,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2022-03-15 19:47:05,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1434. [2022-03-15 19:47:05,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1433 states have (on average 3.265177948360084) internal successors, (4679), 1433 states have internal predecessors, (4679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:05,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 4679 transitions. [2022-03-15 19:47:05,382 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 4679 transitions. Word has length 30 [2022-03-15 19:47:05,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:05,382 INFO L470 AbstractCegarLoop]: Abstraction has 1434 states and 4679 transitions. [2022-03-15 19:47:05,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:05,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 4679 transitions. [2022-03-15 19:47:05,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:47:05,385 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:05,385 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:05,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-03-15 19:47:05,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:05,603 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:47:05,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:05,604 INFO L85 PathProgramCache]: Analyzing trace with hash 648287756, now seen corresponding path program 10 times [2022-03-15 19:47:05,604 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:05,604 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716744490] [2022-03-15 19:47:05,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:05,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:07,070 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:07,070 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:07,070 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716744490] [2022-03-15 19:47:07,070 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716744490] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:47:07,070 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806304220] [2022-03-15 19:47:07,070 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:47:07,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:07,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:07,071 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:47:07,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-03-15 19:47:07,226 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:47:07,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:47:07,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 90 conjunts are in the unsatisfiable core [2022-03-15 19:47:07,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:47:07,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:47:07,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:47:07,267 INFO L353 Elim1Store]: treesize reduction 47, result has 36.5 percent of original size [2022-03-15 19:47:07,267 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 32 [2022-03-15 19:47:07,336 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 19:47:07,399 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 19:47:07,465 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-15 19:47:07,465 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-03-15 19:47:07,535 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:47:07,604 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:47:07,670 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:47:07,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:47:07,884 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 18 treesize of output 20 [2022-03-15 19:47:08,414 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-15 19:47:08,414 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 44 [2022-03-15 19:47:08,425 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 27 treesize of output 15 [2022-03-15 19:47:08,564 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:47:08,689 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:08,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:09,081 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1986 (Array Int Int))) (<= c_~N~0 (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1986) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4)))))) (forall ((v_ArrVal_1986 (Array Int Int))) (< (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1986) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (+ c_~N~0 1)))) (< c_~q2_back~0 0) (not (<= 0 c_~q1_back~0)) (not (< c_~q1_back~0 c_~n1~0)) (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (< c_~q2_front~0 0) (<= c_~n2~0 (+ c_~q2_front~0 1)) (not (= (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset)) |c_thread2Thread1of1ForFork2_~j~0#1|)) (<= c_~n2~0 (+ c_~q2_back~0 1))) is different from false [2022-03-15 19:47:09,120 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1986 (Array Int Int))) (<= c_~N~0 (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1986) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4)))))) (forall ((v_ArrVal_1986 (Array Int Int))) (< (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1986) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (+ c_~N~0 1)))) (not (= (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset)) (select (select |c_#memory_int| c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))) (< c_~q2_back~0 0) (not (<= 0 c_~q1_back~0)) (not (< c_~q1_back~0 c_~n1~0)) (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (< c_~q2_front~0 0) (<= c_~n2~0 (+ c_~q2_front~0 1)) (<= c_~n2~0 (+ c_~q2_back~0 1))) is different from false [2022-03-15 19:47:11,146 INFO L353 Elim1Store]: treesize reduction 28, result has 54.8 percent of original size [2022-03-15 19:47:11,147 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 203 treesize of output 141 [2022-03-15 19:47:11,188 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:47:11,189 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3101 treesize of output 3109 [2022-03-15 19:47:11,233 INFO L353 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2022-03-15 19:47:11,233 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 3109 treesize of output 2649 [2022-03-15 19:47:11,300 INFO L353 Elim1Store]: treesize reduction 48, result has 50.5 percent of original size [2022-03-15 19:47:11,300 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 2649 treesize of output 2445 [2022-03-15 19:47:11,364 INFO L353 Elim1Store]: treesize reduction 48, result has 50.5 percent of original size [2022-03-15 19:47:11,365 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 2445 treesize of output 2295 [2022-03-15 19:47:11,406 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 1133 treesize of output 1037 [2022-03-15 19:47:11,430 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 1037 treesize of output 941 [2022-03-15 19:47:21,364 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-15 19:47:21,364 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806304220] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:47:21,364 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:47:21,364 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 49 [2022-03-15 19:47:21,364 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1888930138] [2022-03-15 19:47:21,364 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:21,367 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:21,379 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 60 transitions. [2022-03-15 19:47:21,379 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:22,287 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [94083#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (+ ~N~0 1)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))), 94084#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (<= ~N~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (= ~t~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (= ~q2~0.offset 0) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (= ~q1~0.offset 0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)))] [2022-03-15 19:47:22,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:47:22,288 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:22,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:47:22,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=2262, Unknown=8, NotChecked=198, Total=2756 [2022-03-15 19:47:22,288 INFO L87 Difference]: Start difference. First operand 1434 states and 4679 transitions. Second operand has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:25,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:25,025 INFO L93 Difference]: Finished difference Result 1751 states and 5548 transitions. [2022-03-15 19:47:25,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 19:47:25,026 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:47:25,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:25,029 INFO L225 Difference]: With dead ends: 1751 [2022-03-15 19:47:25,029 INFO L226 Difference]: Without dead ends: 1730 [2022-03-15 19:47:25,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 31 SyntacticMatches, 9 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=394, Invalid=3512, Unknown=8, NotChecked=246, Total=4160 [2022-03-15 19:47:25,030 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 126 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 1696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:25,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 179 Invalid, 1696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1661 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 19:47:25,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2022-03-15 19:47:25,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1414. [2022-03-15 19:47:25,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1414 states, 1413 states have (on average 3.2745930644019814) internal successors, (4627), 1413 states have internal predecessors, (4627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:25,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 4627 transitions. [2022-03-15 19:47:25,047 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 4627 transitions. Word has length 30 [2022-03-15 19:47:25,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:25,048 INFO L470 AbstractCegarLoop]: Abstraction has 1414 states and 4627 transitions. [2022-03-15 19:47:25,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:25,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 4627 transitions. [2022-03-15 19:47:25,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:47:25,051 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:25,051 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:25,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-03-15 19:47:25,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-03-15 19:47:25,254 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:47:25,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:25,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1205783748, now seen corresponding path program 11 times [2022-03-15 19:47:25,255 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:25,255 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517319781] [2022-03-15 19:47:25,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:25,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:26,417 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:26,417 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:26,418 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517319781] [2022-03-15 19:47:26,418 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517319781] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:47:26,418 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578849265] [2022-03-15 19:47:26,418 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:47:26,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:26,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:26,419 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:47:26,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-03-15 19:47:26,583 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:47:26,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:47:26,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 66 conjunts are in the unsatisfiable core [2022-03-15 19:47:26,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:47:26,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:47:26,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:47:26,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:47:26,624 INFO L353 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-03-15 19:47:26,624 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 32 [2022-03-15 19:47:26,748 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 19:47:26,801 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 19:47:26,801 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-15 19:47:26,851 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:47:26,888 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:47:26,944 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:47:27,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:47:27,121 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:47:27,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:47:27,229 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:47:27,607 INFO L353 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-03-15 19:47:27,607 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 14 [2022-03-15 19:47:27,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:47:27,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:29,347 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:47:29,348 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 209 treesize of output 149 [2022-03-15 19:47:29,443 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:47:29,444 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 923123 treesize of output 888911 [2022-03-15 19:47:31,097 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:47:31,099 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 888665 treesize of output 682889 [2022-03-15 19:47:32,794 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:47:32,797 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 682979 treesize of output 657335 [2022-03-15 19:47:34,520 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:47:34,522 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 657239 treesize of output 605855 [2022-03-15 19:47:36,189 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:47:36,190 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 605657 treesize of output 502793 [2022-03-15 19:48:32,863 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 2 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:48:32,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578849265] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:48:32,864 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:48:32,864 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 44 [2022-03-15 19:48:32,864 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [963447697] [2022-03-15 19:48:32,864 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:48:32,867 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:48:32,889 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 161 transitions. [2022-03-15 19:48:32,889 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:48:49,858 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [98911#(and (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= ~q2~0.offset 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= ~t~0 0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (<= ~n1~0 ~q1_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q2_front~0 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~N~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 98913#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (<= ~q2_front~0 0) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~t~0 0) (<= ~n1~0 ~q1_back~0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (<= ~n2~0 (+ ~q2_back~0 1)) (= ~q2~0.offset 0) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (<= ~N~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (< ~q2_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))), 98912#(and (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~N~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= ~q2~0.offset 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q2_front~0 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (= ~t~0 0) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 98910#(and (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (= ~q2~0.offset 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (<= ~q2_front~0 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 98915#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4)) 0)) (<= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4)))) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (<= ~q2_back~0 (+ 1 ~q2_front~0))) (or (< (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4))) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4)) 0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (<= ~q2_back~0 (+ 1 ~q2_front~0)))), 98914#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (+ ~N~0 1)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))), 98916#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~N~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (= ~q2~0.offset 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~q1~0.offset 0) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0))), 98909#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (< ~q2_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (<= ~N~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= ~q2~0.offset 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (<= ~q2_front~0 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 98908#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (< ~q2_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (= ~t~0 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~N~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (= ~q2~0.offset 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~q2_front~0 0) (< ~q2_back~0 0)))] [2022-03-15 19:48:49,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 19:48:49,859 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:48:49,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 19:48:49,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=2646, Unknown=23, NotChecked=0, Total=2970 [2022-03-15 19:48:49,859 INFO L87 Difference]: Start difference. First operand 1414 states and 4627 transitions. Second operand has 28 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:56,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:48:56,053 INFO L93 Difference]: Finished difference Result 2038 states and 6381 transitions. [2022-03-15 19:48:56,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:48:56,054 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:48:56,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:48:56,057 INFO L225 Difference]: With dead ends: 2038 [2022-03-15 19:48:56,057 INFO L226 Difference]: Without dead ends: 2031 [2022-03-15 19:48:56,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=465, Invalid=4342, Unknown=23, NotChecked=0, Total=4830 [2022-03-15 19:48:56,058 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 169 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 1728 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:48:56,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 230 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1728 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 19:48:56,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2031 states. [2022-03-15 19:48:56,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2031 to 1451. [2022-03-15 19:48:56,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1451 states, 1450 states have (on average 3.263448275862069) internal successors, (4732), 1450 states have internal predecessors, (4732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:56,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 4732 transitions. [2022-03-15 19:48:56,080 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 4732 transitions. Word has length 30 [2022-03-15 19:48:56,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:48:56,080 INFO L470 AbstractCegarLoop]: Abstraction has 1451 states and 4732 transitions. [2022-03-15 19:48:56,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:56,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 4732 transitions. [2022-03-15 19:48:56,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:48:56,083 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:48:56,083 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:48:56,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-03-15 19:48:56,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-03-15 19:48:56,297 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:48:56,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:48:56,297 INFO L85 PathProgramCache]: Analyzing trace with hash 473018828, now seen corresponding path program 12 times [2022-03-15 19:48:56,298 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:48:56,298 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284387709] [2022-03-15 19:48:56,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:48:56,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:48:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:48:57,444 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:57,445 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:48:57,445 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284387709] [2022-03-15 19:48:57,445 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284387709] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:48:57,445 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777084128] [2022-03-15 19:48:57,445 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:48:57,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:57,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:48:57,446 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:48:57,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-03-15 19:48:57,612 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 19:48:57,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:48:57,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 68 conjunts are in the unsatisfiable core [2022-03-15 19:48:57,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:48:58,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:48:58,029 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:48:58,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:48:58,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 18 treesize of output 20 [2022-03-15 19:48:58,507 INFO L353 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-03-15 19:48:58,507 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 14 [2022-03-15 19:48:58,583 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:48:58,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:48:59,181 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:48:59,181 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1353 treesize of output 1277 [2022-03-15 19:48:59,213 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:48:59,214 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 1165 treesize of output 949 [2022-03-15 19:48:59,241 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:48:59,241 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 855 treesize of output 771 [2022-03-15 19:49:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:49:20,810 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777084128] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:20,810 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:20,810 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 12] total 41 [2022-03-15 19:49:20,810 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [514743574] [2022-03-15 19:49:20,810 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:20,813 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:20,836 INFO L252 McrAutomatonBuilder]: Finished intersection with 85 states and 156 transitions. [2022-03-15 19:49:20,836 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:34,064 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [104104#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= ~q2~0.offset 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~N~0 ~t~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~t~0 ~N~0))), 104106#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= ~q2~0.offset 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4)))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4)))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~N~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (= ~t~0 0))), 104109#(and (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (= ~q2~0.offset 0) (< ~q2_back~0 0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~N~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (< ~q2_back~0 0))), 104105#(and (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~t~0 ~N~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~t~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (= ~q2~0.offset 0))), 104110#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (= ~q2~0.offset 0) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (< ~q2_back~0 0))), 104111#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~t~0 (+ ~N~0 1)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= ~N~0 ~t~0))), 104108#(and (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~N~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (= ~q2~0.offset 0) (< ~q2_back~0 0))), 104107#(and (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (= ~t~0 0) (<= ~n1~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (= ~q2~0.offset 0))), 104112#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~N~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (= ~q2~0.offset 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~q1~0.offset 0) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)))] [2022-03-15 19:49:34,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 19:49:34,065 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:34,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 19:49:34,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=2385, Unknown=7, NotChecked=0, Total=2652 [2022-03-15 19:49:34,066 INFO L87 Difference]: Start difference. First operand 1451 states and 4732 transitions. Second operand has 28 states, 27 states have (on average 2.925925925925926) internal successors, (79), 27 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:36,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:36,753 INFO L93 Difference]: Finished difference Result 1701 states and 5296 transitions. [2022-03-15 19:49:36,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 19:49:36,753 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.925925925925926) internal successors, (79), 27 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:49:36,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:36,756 INFO L225 Difference]: With dead ends: 1701 [2022-03-15 19:49:36,756 INFO L226 Difference]: Without dead ends: 1676 [2022-03-15 19:49:36,757 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 70 SyntacticMatches, 10 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 956 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=371, Invalid=3654, Unknown=7, NotChecked=0, Total=4032 [2022-03-15 19:49:36,757 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 126 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 1710 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 1773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:36,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 164 Invalid, 1773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1710 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 19:49:36,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2022-03-15 19:49:36,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1426. [2022-03-15 19:49:36,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1425 states have (on average 3.2750877192982455) internal successors, (4667), 1425 states have internal predecessors, (4667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:36,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 4667 transitions. [2022-03-15 19:49:36,778 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 4667 transitions. Word has length 30 [2022-03-15 19:49:36,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:36,778 INFO L470 AbstractCegarLoop]: Abstraction has 1426 states and 4667 transitions. [2022-03-15 19:49:36,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.925925925925926) internal successors, (79), 27 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:36,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 4667 transitions. [2022-03-15 19:49:36,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:49:36,781 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:36,781 INFO L514 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:36,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-03-15 19:49:36,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:36,981 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:49:36,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:36,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1267382797, now seen corresponding path program 13 times [2022-03-15 19:49:36,983 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:36,983 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955940350] [2022-03-15 19:49:36,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:36,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:38,290 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:49:38,290 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:38,290 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955940350] [2022-03-15 19:49:38,290 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955940350] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:38,290 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761206971] [2022-03-15 19:49:38,290 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:49:38,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:38,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:38,292 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:38,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-03-15 19:49:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:38,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 19:49:38,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:38,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:49:38,755 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:49:38,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:49:38,795 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:49:38,826 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:49:38,859 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:49:38,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:38,903 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2197 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2197) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) 0))) is different from false [2022-03-15 19:49:38,912 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2197 (Array Int Int)) (v_ArrVal_2196 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2196) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2197) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) 0))) is different from false [2022-03-15 19:49:38,922 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:49:38,923 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 85 treesize of output 85 [2022-03-15 19:49:38,925 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 64 treesize of output 58 [2022-03-15 19:49:38,927 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 46 [2022-03-15 19:49:39,082 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 1 not checked. [2022-03-15 19:49:39,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761206971] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:39,083 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:39,083 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 7] total 30 [2022-03-15 19:49:39,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [594916849] [2022-03-15 19:49:39,083 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:39,086 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:39,103 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 110 transitions. [2022-03-15 19:49:39,103 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:39,309 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:49:39,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:49:39,309 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:39,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:49:39,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=736, Unknown=2, NotChecked=110, Total=930 [2022-03-15 19:49:39,310 INFO L87 Difference]: Start difference. First operand 1426 states and 4667 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:41,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:41,020 INFO L93 Difference]: Finished difference Result 1839 states and 5833 transitions. [2022-03-15 19:49:41,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 19:49:41,020 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:49:41,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:41,023 INFO L225 Difference]: With dead ends: 1839 [2022-03-15 19:49:41,023 INFO L226 Difference]: Without dead ends: 1772 [2022-03-15 19:49:41,023 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=170, Invalid=1168, Unknown=2, NotChecked=142, Total=1482 [2022-03-15 19:49:41,023 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 36 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:41,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 92 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:49:41,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2022-03-15 19:49:41,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 1427. [2022-03-15 19:49:41,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1426 states have (on average 3.274193548387097) internal successors, (4669), 1426 states have internal predecessors, (4669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:41,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 4669 transitions. [2022-03-15 19:49:41,040 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 4669 transitions. Word has length 31 [2022-03-15 19:49:41,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:41,041 INFO L470 AbstractCegarLoop]: Abstraction has 1427 states and 4669 transitions. [2022-03-15 19:49:41,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:41,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 4669 transitions. [2022-03-15 19:49:41,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:49:41,043 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:41,043 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2022-03-15 19:49:41,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-03-15 19:49:41,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-03-15 19:49:41,243 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:49:41,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:41,244 INFO L85 PathProgramCache]: Analyzing trace with hash -560175630, now seen corresponding path program 13 times [2022-03-15 19:49:41,245 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:41,245 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851765822] [2022-03-15 19:49:41,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:41,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:43,315 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:43,316 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:43,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851765822] [2022-03-15 19:49:43,316 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851765822] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:43,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781912625] [2022-03-15 19:49:43,316 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:49:43,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:43,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:43,320 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:43,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-03-15 19:49:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:43,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 76 conjunts are in the unsatisfiable core [2022-03-15 19:49:43,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:44,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:49:44,107 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:49:44,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:49:44,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:49:44,497 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-15 19:49:44,497 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 40 [2022-03-15 19:49:44,624 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 34 treesize of output 10 [2022-03-15 19:49:44,689 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:49:44,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:44,797 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2263 (Array Int Int))) (<= c_~N~0 (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2263) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4)))))) (forall ((v_ArrVal_2263 (Array Int Int))) (< (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2263) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (+ c_~N~0 1)))) is different from false [2022-03-15 19:49:44,896 WARN L838 $PredicateComparison]: unable to prove that (or (< c_~q2_back~0 0) (= |c_thread2Thread1of1ForFork2_~j~0#1| 0) (and (forall ((v_ArrVal_2263 (Array Int Int))) (<= c_~N~0 (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2263) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4)))))) (forall ((v_ArrVal_2263 (Array Int Int))) (< (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2263) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (+ c_~N~0 1)))) (not (= (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset)) |c_thread2Thread1of1ForFork2_~j~0#1|)) (<= c_~n2~0 (+ c_~q2_back~0 1))) is different from false [2022-03-15 19:49:44,914 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))) (or (not (= (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset)) .cse0)) (< c_~q2_back~0 0) (and (forall ((v_ArrVal_2263 (Array Int Int))) (<= c_~N~0 (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2263) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4)))))) (forall ((v_ArrVal_2263 (Array Int Int))) (< (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2263) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (+ c_~N~0 1)))) (= .cse0 0) (<= c_~n2~0 (+ c_~q2_back~0 1)))) is different from false [2022-03-15 19:49:45,235 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:49:45,235 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 391 treesize of output 427 [2022-03-15 19:49:45,253 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:49:45,254 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 427 treesize of output 427 [2022-03-15 19:49:45,265 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 205 treesize of output 193 [2022-03-15 19:49:45,272 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 193 treesize of output 169 [2022-03-15 19:49:50,283 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2022-03-15 19:49:50,283 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781912625] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:50,283 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:50,283 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 14] total 47 [2022-03-15 19:49:50,283 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [142401465] [2022-03-15 19:49:50,284 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:50,287 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:50,297 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 61 transitions. [2022-03-15 19:49:50,298 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:50,927 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [113840#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4)) 0)) (<= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4)))) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (<= ~q2_back~0 (+ 1 ~q2_front~0))) (or (< (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4))) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4)) 0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (<= ~q2_back~0 (+ 1 ~q2_front~0)))), 113839#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (+ ~N~0 1)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))))] [2022-03-15 19:49:50,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:49:50,928 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:50,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:49:50,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=2036, Unknown=4, NotChecked=282, Total=2550 [2022-03-15 19:49:50,929 INFO L87 Difference]: Start difference. First operand 1427 states and 4669 transitions. Second operand has 23 states, 22 states have (on average 2.0) internal successors, (44), 22 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:53,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:53,731 INFO L93 Difference]: Finished difference Result 2409 states and 7777 transitions. [2022-03-15 19:49:53,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 19:49:53,731 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 22 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:49:53,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:53,735 INFO L225 Difference]: With dead ends: 2409 [2022-03-15 19:49:53,735 INFO L226 Difference]: Without dead ends: 2353 [2022-03-15 19:49:53,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=345, Invalid=3085, Unknown=4, NotChecked=348, Total=3782 [2022-03-15 19:49:53,736 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 141 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 1633 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 1692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:53,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 252 Invalid, 1692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1633 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 19:49:53,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2022-03-15 19:49:53,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 1575. [2022-03-15 19:49:53,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1574 states have (on average 3.2433290978398985) internal successors, (5105), 1574 states have internal predecessors, (5105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:53,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 5105 transitions. [2022-03-15 19:49:53,760 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 5105 transitions. Word has length 31 [2022-03-15 19:49:53,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:53,760 INFO L470 AbstractCegarLoop]: Abstraction has 1575 states and 5105 transitions. [2022-03-15 19:49:53,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 22 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:53,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 5105 transitions. [2022-03-15 19:49:53,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:49:53,763 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:53,763 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2022-03-15 19:49:53,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-03-15 19:49:53,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-03-15 19:49:53,971 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:49:53,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:53,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1503270658, now seen corresponding path program 14 times [2022-03-15 19:49:53,978 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:53,978 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532727583] [2022-03-15 19:49:53,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:53,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:55,478 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:55,478 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:55,478 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532727583] [2022-03-15 19:49:55,478 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532727583] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:55,478 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995304769] [2022-03-15 19:49:55,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:49:55,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:55,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:55,479 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:55,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-03-15 19:49:55,651 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:49:55,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:49:55,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-15 19:49:55,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:56,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:49:56,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 18 treesize of output 20 [2022-03-15 19:49:56,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:49:56,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:49:56,396 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-15 19:49:56,396 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 40 [2022-03-15 19:49:56,501 INFO L353 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-03-15 19:49:56,501 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 14 [2022-03-15 19:49:56,581 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:49:56,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:56,680 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2329 (Array Int Int))) (< (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2329) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (+ c_~N~0 1))) (forall ((v_ArrVal_2329 (Array Int Int))) (<= c_~N~0 (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2329) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))))))) is different from false [2022-03-15 19:49:56,786 WARN L838 $PredicateComparison]: unable to prove that (forall ((~q2~0.offset Int)) (or (and (forall ((v_ArrVal_2329 (Array Int Int))) (< (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2329) c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_front~0 4)))) (+ c_~N~0 1))) (forall ((v_ArrVal_2329 (Array Int Int))) (<= c_~N~0 (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2329) c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_front~0 4))))))) (not (= (select (select |c_#memory_int| c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_back~0 4))) (select (select |c_#memory_int| c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))))) is different from false [2022-03-15 19:49:56,844 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2328 (Array Int Int)) (~q2~0.offset Int)) (or (and (forall ((v_ArrVal_2329 (Array Int Int))) (< (+ c_~t~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2328) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2329) c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_front~0 4)))) (+ c_~N~0 1))) (forall ((v_ArrVal_2329 (Array Int Int))) (<= c_~N~0 (+ c_~t~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2328) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2329) c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_front~0 4))))))) (not (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2328))) (= (select (select .cse0 c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_back~0 4))) (select (select .cse0 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset))))))) is different from false [2022-03-15 19:49:56,958 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:49:56,959 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 276 treesize of output 328 [2022-03-15 19:49:56,974 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:49:56,974 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 328 treesize of output 340 [2022-03-15 19:49:56,983 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 121 [2022-03-15 19:49:56,989 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 121 treesize of output 109 [2022-03-15 19:49:59,103 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-03-15 19:49:59,103 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995304769] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:59,103 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:59,103 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 11] total 43 [2022-03-15 19:49:59,103 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1273594698] [2022-03-15 19:49:59,103 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:59,108 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:59,120 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 59 transitions. [2022-03-15 19:49:59,120 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:59,770 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [119647#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~t~0 (+ ~N~0 1)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= ~N~0 ~t~0)))] [2022-03-15 19:49:59,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:49:59,770 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:59,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:49:59,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1655, Unknown=10, NotChecked=252, Total=2070 [2022-03-15 19:49:59,772 INFO L87 Difference]: Start difference. First operand 1575 states and 5105 transitions. Second operand has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:01,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:50:01,263 INFO L93 Difference]: Finished difference Result 2097 states and 6656 transitions. [2022-03-15 19:50:01,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:50:01,263 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:50:01,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:50:01,267 INFO L225 Difference]: With dead ends: 2097 [2022-03-15 19:50:01,267 INFO L226 Difference]: Without dead ends: 2076 [2022-03-15 19:50:01,267 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 41 SyntacticMatches, 8 SemanticMatches, 51 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=192, Invalid=2260, Unknown=10, NotChecked=294, Total=2756 [2022-03-15 19:50:01,268 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 103 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:50:01,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 185 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:50:01,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2076 states. [2022-03-15 19:50:01,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2076 to 1509. [2022-03-15 19:50:01,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1508 states have (on average 3.2652519893899203) internal successors, (4924), 1508 states have internal predecessors, (4924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:01,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 4924 transitions. [2022-03-15 19:50:01,288 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 4924 transitions. Word has length 31 [2022-03-15 19:50:01,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:50:01,288 INFO L470 AbstractCegarLoop]: Abstraction has 1509 states and 4924 transitions. [2022-03-15 19:50:01,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:01,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 4924 transitions. [2022-03-15 19:50:01,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:50:01,290 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:50:01,291 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2022-03-15 19:50:01,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-03-15 19:50:01,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-03-15 19:50:01,491 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:50:01,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:50:01,491 INFO L85 PathProgramCache]: Analyzing trace with hash -390122196, now seen corresponding path program 15 times [2022-03-15 19:50:01,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:50:01,492 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287253046] [2022-03-15 19:50:01,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:50:01,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:50:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:50:02,943 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:02,943 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:50:02,943 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287253046] [2022-03-15 19:50:02,943 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287253046] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:50:02,943 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292130454] [2022-03-15 19:50:02,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:50:02,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:50:02,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:50:02,945 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:50:02,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-03-15 19:50:03,140 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:50:03,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:50:03,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-15 19:50:03,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:50:03,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:50:03,460 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:50:03,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:50:03,543 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:50:03,770 INFO L353 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-03-15 19:50:03,771 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 10 [2022-03-15 19:50:03,834 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 19:50:03,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:50:06,150 WARN L838 $PredicateComparison]: unable to prove that (forall ((~q2~0.base Int) (~q2~0.offset Int) (v_ArrVal_2395 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2395))) (let ((.cse3 (select .cse1 ~q2~0.base))) (let ((.cse0 (select .cse3 (+ ~q2~0.offset (* c_~q2_back~0 4))))) (or (= .cse0 0) (not (= .cse0 (select (select .cse1 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))) (let ((.cse2 (+ c_~t~0 (select .cse3 (+ ~q2~0.offset (* c_~q2_front~0 4)))))) (and (<= .cse2 c_~N~0) (<= c_~N~0 .cse2)))))))) is different from false [2022-03-15 19:50:06,222 WARN L838 $PredicateComparison]: unable to prove that (forall ((~q2~0.base Int) (~q2~0.offset Int) (v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2394) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2395))) (let ((.cse1 (select .cse2 ~q2~0.base))) (let ((.cse3 (select .cse1 (+ ~q2~0.offset (* c_~q2_back~0 4))))) (or (let ((.cse0 (+ c_~t~0 (select .cse1 (+ ~q2~0.offset (* c_~q2_front~0 4)))))) (and (<= c_~N~0 .cse0) (<= .cse0 c_~N~0))) (not (= (select (select .cse2 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse3)) (= .cse3 0)))))) is different from false [2022-03-15 19:50:06,335 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:50:06,335 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 655 treesize of output 667 [2022-03-15 19:50:06,361 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:50:06,361 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 528 treesize of output 510 [2022-03-15 19:50:06,383 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:50:06,383 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 489 treesize of output 405 [2022-03-15 19:50:31,374 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 19:50:31,374 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292130454] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:50:31,374 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:50:31,375 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 10] total 37 [2022-03-15 19:50:31,375 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1743157051] [2022-03-15 19:50:31,375 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:50:31,378 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:50:31,402 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 158 transitions. [2022-03-15 19:50:31,402 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:50:49,917 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [124996#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~N~0 1) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (< ~q2_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (= ~t~0 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= 1 ~N~0) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (= ~q2~0.offset 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~q2_front~0 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) (< ~q2_back~0 0))), 125001#(and (or (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 (+ ~q1_front~0 1)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) (<= ~n2~0 (+ ~q2_back~0 1)) (<= ~q1_back~0 (+ ~q1_front~0 1)) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (< ~q2_back~0 0)) (or (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 (+ ~q1_front~0 1)) (<= 1 ~N~0) (<= ~n2~0 (+ ~q2_back~0 1)) (<= ~q1_back~0 (+ ~q1_front~0 1)) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (< ~q2_back~0 0)) (or (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 (+ ~q1_front~0 1)) (<= ~n2~0 (+ ~q2_back~0 1)) (<= ~q1_back~0 (+ ~q1_front~0 1)) (<= ~N~0 1) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (< ~q2_back~0 0)) (or (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 (+ ~q1_front~0 1)) (<= ~n2~0 (+ ~q2_back~0 1)) (<= ~q1_back~0 (+ ~q1_front~0 1)) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (< ~q2_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (or (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 (+ ~q1_front~0 1)) (<= ~n2~0 (+ ~q2_back~0 1)) (<= ~q1_back~0 (+ ~q1_front~0 1)) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (<= ~q2_front~0 0) (< ~q2_back~0 0)) (or (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 (+ ~q1_front~0 1)) (= ~t~0 0) (<= ~n2~0 (+ ~q2_back~0 1)) (<= ~q1_back~0 (+ ~q1_front~0 1)) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (< ~q2_back~0 0)) (or (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 (+ ~q1_front~0 1)) (<= ~n2~0 (+ ~q2_back~0 1)) (<= ~q1_back~0 (+ ~q1_front~0 1)) (= ~q2~0.offset 0) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (< ~q2_back~0 0))), 125000#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4)) 0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (<= (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) ~N~0) (<= ~q2_back~0 (+ 1 ~q2_front~0))) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4)) 0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (<= ~q2_back~0 (+ 1 ~q2_front~0)) (<= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))), 124999#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~q2_front~0 0) (<= ~t~0 ~N~0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= ~N~0 ~t~0))), 124997#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (< ~q2_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (<= ~N~0 1) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= ~q2~0.offset 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= 1 ~N~0) (<= ~n2~0 ~q2_back~0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (<= ~q2_front~0 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 124998#(and (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= ~q2~0.offset 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= ~t~0 0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q2_front~0 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~N~0 1) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))] [2022-03-15 19:50:49,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 19:50:49,918 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:50:49,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 19:50:49,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1599, Unknown=2, NotChecked=166, Total=1980 [2022-03-15 19:50:49,918 INFO L87 Difference]: Start difference. First operand 1509 states and 4924 transitions. Second operand has 25 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:53,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:50:53,813 INFO L93 Difference]: Finished difference Result 2461 states and 7833 transitions. [2022-03-15 19:50:53,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 19:50:53,813 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:50:53,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:50:53,818 INFO L225 Difference]: With dead ends: 2461 [2022-03-15 19:50:53,818 INFO L226 Difference]: Without dead ends: 2435 [2022-03-15 19:50:53,819 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 87 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=389, Invalid=3039, Unknown=2, NotChecked=230, Total=3660 [2022-03-15 19:50:53,819 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 161 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 2076 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 2148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:50:53,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 279 Invalid, 2148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2076 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 19:50:53,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2022-03-15 19:50:53,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 1564. [2022-03-15 19:50:53,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 1563 states have (on average 3.2507997440818936) internal successors, (5081), 1563 states have internal predecessors, (5081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:53,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 5081 transitions. [2022-03-15 19:50:53,842 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 5081 transitions. Word has length 31 [2022-03-15 19:50:53,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:50:53,843 INFO L470 AbstractCegarLoop]: Abstraction has 1564 states and 5081 transitions. [2022-03-15 19:50:53,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:53,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 5081 transitions. [2022-03-15 19:50:53,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:50:53,845 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:50:53,845 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2022-03-15 19:50:53,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-03-15 19:50:54,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:50:54,046 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:50:54,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:50:54,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1122887116, now seen corresponding path program 16 times [2022-03-15 19:50:54,047 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:50:54,047 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803877626] [2022-03-15 19:50:54,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:50:54,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:50:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:50:55,369 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:55,369 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:50:55,370 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803877626] [2022-03-15 19:50:55,370 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803877626] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:50:55,370 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807346457] [2022-03-15 19:50:55,370 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:50:55,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:50:55,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:50:55,371 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:50:55,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-03-15 19:50:55,561 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:50:55,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:50:55,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 72 conjunts are in the unsatisfiable core [2022-03-15 19:50:55,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:50:56,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:50:56,076 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:50:56,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:50:56,172 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:50:56,477 INFO L353 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-03-15 19:50:56,477 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 44 treesize of output 10 [2022-03-15 19:50:56,593 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:50:56,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:50:57,214 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:50:57,214 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 588 treesize of output 608 [2022-03-15 19:50:57,240 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:50:57,240 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 496 treesize of output 424 [2022-03-15 19:50:57,262 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:50:57,262 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 376 treesize of output 364 [2022-03-15 19:51:06,076 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:51:06,077 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807346457] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:51:06,077 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:51:06,077 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 14] total 46 [2022-03-15 19:51:06,077 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [912761368] [2022-03-15 19:51:06,077 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:51:06,080 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:51:06,103 INFO L252 McrAutomatonBuilder]: Finished intersection with 83 states and 148 transitions. [2022-03-15 19:51:06,103 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:51:18,902 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [130854#(and (or (< ~q1_front~0 0) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n1~0 (+ ~q1_front~0 1)) (<= ~n2~0 ~q2_back~0) (<= ~q1_back~0 (+ ~q1_front~0 1)) (< ~q2_back~0 0)) (or (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 (+ ~q1_front~0 1)) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (<= ~q1_back~0 (+ ~q1_front~0 1)) (< ~q2_back~0 0)) (or (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n1~0 (+ ~q1_front~0 1)) (<= ~n2~0 ~q2_back~0) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) (<= ~q1_back~0 (+ ~q1_front~0 1)) (< ~q2_back~0 0)) (or (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 (+ ~q1_front~0 1)) (<= ~n2~0 ~q2_back~0) (<= ~q1_back~0 (+ ~q1_front~0 1)) (= ~q2~0.offset 0) (< ~q2_back~0 0)) (or (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n1~0 (+ ~q1_front~0 1)) (<= ~n2~0 ~q2_back~0) (<= ~q1_back~0 (+ ~q1_front~0 1)) (< ~q2_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (or (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 (+ ~q1_front~0 1)) (<= 1 ~N~0) (<= ~n2~0 ~q2_back~0) (<= ~q1_back~0 (+ ~q1_front~0 1)) (< ~q2_back~0 0)) (or (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 (+ ~q1_front~0 1)) (<= ~n2~0 ~q2_back~0) (<= ~q1_back~0 (+ ~q1_front~0 1)) (<= ~N~0 1) (< ~q2_back~0 0))), 130852#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= ~q2~0.offset 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 ~N~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4)))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~N~0 1)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= ~t~0 0))), 130853#(and (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 ~N~0) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~N~0 1) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (= ~q2~0.offset 0) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) (< ~q2_back~0 0))), 130851#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~N~0 ~t~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~t~0 ~N~0) (= ~q2~0.offset 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~N~0 ~t~0) (= ~q2~0.offset 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~t~0 ~N~0))), 130855#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~q2_front~0 0) (<= ~t~0 ~N~0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= ~N~0 ~t~0)))] [2022-03-15 19:51:18,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 19:51:18,902 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:51:18,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 19:51:18,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=2461, Unknown=9, NotChecked=0, Total=2756 [2022-03-15 19:51:18,903 INFO L87 Difference]: Start difference. First operand 1564 states and 5081 transitions. Second operand has 24 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:22,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:51:22,860 INFO L93 Difference]: Finished difference Result 2174 states and 6875 transitions. [2022-03-15 19:51:22,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 19:51:22,861 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:51:22,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:51:22,864 INFO L225 Difference]: With dead ends: 2174 [2022-03-15 19:51:22,865 INFO L226 Difference]: Without dead ends: 2161 [2022-03-15 19:51:22,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 68 SyntacticMatches, 11 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1269 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=597, Invalid=4796, Unknown=9, NotChecked=0, Total=5402 [2022-03-15 19:51:22,865 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 139 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:51:22,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 238 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 19:51:22,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2161 states. [2022-03-15 19:51:22,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2161 to 1515. [2022-03-15 19:51:22,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 1514 states have (on average 3.2747688243064728) internal successors, (4958), 1514 states have internal predecessors, (4958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:22,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 4958 transitions. [2022-03-15 19:51:22,893 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 4958 transitions. Word has length 31 [2022-03-15 19:51:22,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:51:22,894 INFO L470 AbstractCegarLoop]: Abstraction has 1515 states and 4958 transitions. [2022-03-15 19:51:22,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:22,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 4958 transitions. [2022-03-15 19:51:22,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:51:22,897 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:51:22,897 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2022-03-15 19:51:22,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-03-15 19:51:23,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:23,111 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:51:23,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:51:23,112 INFO L85 PathProgramCache]: Analyzing trace with hash -326201000, now seen corresponding path program 17 times [2022-03-15 19:51:23,113 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:51:23,113 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712231085] [2022-03-15 19:51:23,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:51:23,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:51:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:51:24,569 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:51:24,569 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:51:24,569 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712231085] [2022-03-15 19:51:24,569 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712231085] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:51:24,569 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141958316] [2022-03-15 19:51:24,569 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:51:24,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:24,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:51:24,571 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:51:24,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-03-15 19:51:24,756 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:51:24,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:51:24,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-15 19:51:24,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:51:24,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:51:24,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:51:24,792 INFO L353 Elim1Store]: treesize reduction 49, result has 33.8 percent of original size [2022-03-15 19:51:24,793 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 35 [2022-03-15 19:51:24,907 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 19:51:24,907 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-15 19:51:25,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:51:25,125 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:51:25,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:51:25,331 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-15 19:51:25,331 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 40 [2022-03-15 19:51:25,511 INFO L353 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-03-15 19:51:25,512 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 54 treesize of output 14 [2022-03-15 19:51:25,579 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:51:25,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:51:26,224 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:51:26,225 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 343 treesize of output 387 [2022-03-15 19:51:26,247 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:51:26,247 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 248 treesize of output 254 [2022-03-15 19:51:26,254 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 187 treesize of output 151 [2022-03-15 19:51:28,012 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 19:51:28,012 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141958316] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:51:28,012 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:51:28,012 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 11] total 41 [2022-03-15 19:51:28,012 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [648905520] [2022-03-15 19:51:28,012 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:51:28,015 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:51:28,033 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 108 transitions. [2022-03-15 19:51:28,033 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:51:35,558 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [136328#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (<= 0 ~q2_front~0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (<= ~N~0 1) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= ~q2~0.offset 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= 1 ~N~0) (<= ~n2~0 ~q2_back~0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (<= ~q2_front~0 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 136329#(and (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 1) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (= ~q2~0.offset 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= 1 ~N~0) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n2~0 ~q2_back~0) (<= 0 ~q2_front~0) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (<= ~q2_front~0 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 136326#(and (or (< (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4)) 0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (<= ~q2_back~0 (+ 1 ~q2_front~0))) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4)) 0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (<= ~q2_back~0 (+ 1 ~q2_front~0)) (<= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))), 136327#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~N~0 1) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (= ~t~0 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= 1 ~N~0) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (<= 0 ~q2_front~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (= ~q2~0.offset 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~q2_front~0 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) (< ~q2_back~0 0))), 136325#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~t~0 (+ ~N~0 1)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= ~N~0 ~t~0)))] [2022-03-15 19:51:35,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:51:35,558 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:51:35,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:51:35,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=2044, Unknown=6, NotChecked=0, Total=2256 [2022-03-15 19:51:35,559 INFO L87 Difference]: Start difference. First operand 1515 states and 4958 transitions. Second operand has 26 states, 25 states have (on average 2.4) internal successors, (60), 25 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:40,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:51:40,461 INFO L93 Difference]: Finished difference Result 2955 states and 9556 transitions. [2022-03-15 19:51:40,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 19:51:40,461 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.4) internal successors, (60), 25 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:51:40,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:51:40,466 INFO L225 Difference]: With dead ends: 2955 [2022-03-15 19:51:40,466 INFO L226 Difference]: Without dead ends: 2893 [2022-03-15 19:51:40,467 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=462, Invalid=4362, Unknown=6, NotChecked=0, Total=4830 [2022-03-15 19:51:40,467 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 180 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 1845 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:51:40,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 228 Invalid, 1934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1845 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 19:51:40,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2022-03-15 19:51:40,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 1547. [2022-03-15 19:51:40,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1546 states have (on average 3.2690815006468306) internal successors, (5054), 1546 states have internal predecessors, (5054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:40,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 5054 transitions. [2022-03-15 19:51:40,497 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 5054 transitions. Word has length 31 [2022-03-15 19:51:40,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:51:40,497 INFO L470 AbstractCegarLoop]: Abstraction has 1547 states and 5054 transitions. [2022-03-15 19:51:40,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.4) internal successors, (60), 25 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:40,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 5054 transitions. [2022-03-15 19:51:40,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:51:40,501 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:51:40,501 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2022-03-15 19:51:40,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-03-15 19:51:40,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-03-15 19:51:40,723 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:51:40,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:51:40,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1058965920, now seen corresponding path program 18 times [2022-03-15 19:51:40,724 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:51:40,724 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594006122] [2022-03-15 19:51:40,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:51:40,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:51:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:51:42,526 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:51:42,526 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:51:42,526 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594006122] [2022-03-15 19:51:42,526 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594006122] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:51:42,526 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472854135] [2022-03-15 19:51:42,526 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:51:42,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:42,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:51:42,528 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:51:42,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-03-15 19:51:42,712 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:51:42,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:51:42,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 66 conjunts are in the unsatisfiable core [2022-03-15 19:51:42,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:51:43,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:51:43,165 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:51:43,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:51:43,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:51:43,400 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-15 19:51:43,400 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 42 [2022-03-15 19:51:44,167 INFO L353 Elim1Store]: treesize reduction 21, result has 4.5 percent of original size [2022-03-15 19:51:44,167 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 14 [2022-03-15 19:51:44,255 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:51:44,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:51:44,849 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:51:44,850 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 305 treesize of output 349 [2022-03-15 19:51:44,887 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:51:44,887 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 349 treesize of output 355 [2022-03-15 19:51:44,897 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 133 treesize of output 121 [2022-03-15 19:51:44,904 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 121 treesize of output 109 [2022-03-15 19:51:46,033 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 19:51:46,034 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472854135] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:51:46,034 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:51:46,034 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 11] total 43 [2022-03-15 19:51:46,034 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1569746412] [2022-03-15 19:51:46,034 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:51:46,037 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:51:46,055 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 103 transitions. [2022-03-15 19:51:46,055 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:51:50,195 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [142652#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~t~0 (+ ~N~0 1)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= ~N~0 ~t~0))), 142650#(and (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~t~0 ~N~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~t~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (= ~q2~0.offset 0))), 142651#(and (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (= ~t~0 0) (<= ~n1~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (<= ~n1~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 1)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)) (<= ~n1~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (= ~q2~0.offset 0))), 142649#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= ~q2~0.offset 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~N~0 1)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4)))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (= ~t~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= ~n1~0 ~q1_front~0) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)))), 142648#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= ~q2~0.offset 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~N~0 ~t~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~t~0 ~N~0)))] [2022-03-15 19:51:50,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:51:50,196 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:51:50,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:51:50,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2249, Unknown=6, NotChecked=0, Total=2450 [2022-03-15 19:51:50,196 INFO L87 Difference]: Start difference. First operand 1547 states and 5054 transitions. Second operand has 26 states, 25 states have (on average 2.44) internal successors, (61), 25 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:54,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:51:54,122 INFO L93 Difference]: Finished difference Result 2525 states and 7907 transitions. [2022-03-15 19:51:54,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 19:51:54,122 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.44) internal successors, (61), 25 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:51:54,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:51:54,126 INFO L225 Difference]: With dead ends: 2525 [2022-03-15 19:51:54,126 INFO L226 Difference]: Without dead ends: 2500 [2022-03-15 19:51:54,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 54 SyntacticMatches, 9 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=355, Invalid=3929, Unknown=6, NotChecked=0, Total=4290 [2022-03-15 19:51:54,127 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 103 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 1897 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 1986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:51:54,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 231 Invalid, 1986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1897 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 19:51:54,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2500 states. [2022-03-15 19:51:54,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2500 to 1517. [2022-03-15 19:51:54,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1516 states have (on average 3.2763852242744065) internal successors, (4967), 1516 states have internal predecessors, (4967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:54,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 4967 transitions. [2022-03-15 19:51:54,149 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 4967 transitions. Word has length 31 [2022-03-15 19:51:54,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:51:54,149 INFO L470 AbstractCegarLoop]: Abstraction has 1517 states and 4967 transitions. [2022-03-15 19:51:54,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.44) internal successors, (61), 25 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:54,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 4967 transitions. [2022-03-15 19:51:54,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:51:54,151 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:51:54,151 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2022-03-15 19:51:54,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-03-15 19:51:54,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-03-15 19:51:54,352 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:51:54,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:51:54,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1327238238, now seen corresponding path program 19 times [2022-03-15 19:51:54,353 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:51:54,353 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181876327] [2022-03-15 19:51:54,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:51:54,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:51:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:51:55,741 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:51:55,741 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:51:55,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181876327] [2022-03-15 19:51:55,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181876327] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:51:55,742 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572118742] [2022-03-15 19:51:55,742 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:51:55,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:55,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:51:55,743 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:51:55,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-03-15 19:51:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:51:55,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 71 conjunts are in the unsatisfiable core [2022-03-15 19:51:55,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:51:56,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:51:56,497 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:51:56,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:51:56,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:51:56,955 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-15 19:51:56,955 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 40 [2022-03-15 19:51:57,687 INFO L353 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-03-15 19:51:57,688 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 10 [2022-03-15 19:51:57,759 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:51:57,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:51:57,857 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2663 (Array Int Int))) (< (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2663) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (+ c_~N~0 1))) (forall ((v_ArrVal_2663 (Array Int Int))) (<= c_~N~0 (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2663) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))))))) is different from false [2022-03-15 19:51:58,009 WARN L838 $PredicateComparison]: unable to prove that (or (< c_~q2_back~0 0) (and (forall ((v_ArrVal_2663 (Array Int Int))) (< (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2663) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (+ c_~N~0 1))) (forall ((v_ArrVal_2663 (Array Int Int))) (<= c_~N~0 (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2663) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))))))) (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (= |c_thread2Thread1of1ForFork2_~j~0#1| 0) (not (= (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset)) |c_thread2Thread1of1ForFork2_~j~0#1|)) (<= c_~n2~0 (+ c_~q2_back~0 1))) is different from false [2022-03-15 19:51:58,030 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))) (or (not (= (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset)) .cse0)) (< c_~q2_back~0 0) (and (forall ((v_ArrVal_2663 (Array Int Int))) (< (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2663) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (+ c_~N~0 1))) (forall ((v_ArrVal_2663 (Array Int Int))) (<= c_~N~0 (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2663) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))))))) (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (= .cse0 0) (<= c_~n2~0 (+ c_~q2_back~0 1)))) is different from false [2022-03-15 19:51:58,210 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:51:58,211 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 305 treesize of output 349 [2022-03-15 19:51:58,228 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:51:58,229 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 349 treesize of output 355 [2022-03-15 19:51:58,260 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 121 [2022-03-15 19:51:58,268 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 121 treesize of output 109 [2022-03-15 19:52:01,590 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2022-03-15 19:52:01,590 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572118742] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:52:01,590 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:52:01,590 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 14] total 46 [2022-03-15 19:52:01,590 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2110294630] [2022-03-15 19:52:01,591 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:52:01,593 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:52:01,605 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 63 transitions. [2022-03-15 19:52:01,605 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:52:02,521 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [148473#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4)) 0)) (<= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4)))) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (<= ~q2_back~0 (+ 1 ~q2_front~0))) (or (< (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4))) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4)) 0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (<= ~q2_back~0 (+ 1 ~q2_front~0)))), 148474#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~N~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (<= 0 ~q2_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (= ~q2~0.offset 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~q1~0.offset 0) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0))), 148472#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (+ ~N~0 1)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))))] [2022-03-15 19:52:02,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:52:02,521 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:52:02,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:52:02,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=2050, Unknown=5, NotChecked=282, Total=2550 [2022-03-15 19:52:02,522 INFO L87 Difference]: Start difference. First operand 1517 states and 4967 transitions. Second operand has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:05,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:52:05,743 INFO L93 Difference]: Finished difference Result 2691 states and 8716 transitions. [2022-03-15 19:52:05,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 19:52:05,743 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:52:05,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:52:05,748 INFO L225 Difference]: With dead ends: 2691 [2022-03-15 19:52:05,748 INFO L226 Difference]: Without dead ends: 2643 [2022-03-15 19:52:05,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=344, Invalid=3569, Unknown=5, NotChecked=372, Total=4290 [2022-03-15 19:52:05,749 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 137 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 1935 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 2000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:52:05,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 239 Invalid, 2000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1935 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 19:52:05,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2643 states. [2022-03-15 19:52:05,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2643 to 1589. [2022-03-15 19:52:05,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1588 states have (on average 3.2783375314861463) internal successors, (5206), 1588 states have internal predecessors, (5206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:05,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 5206 transitions. [2022-03-15 19:52:05,789 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 5206 transitions. Word has length 31 [2022-03-15 19:52:05,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:52:05,790 INFO L470 AbstractCegarLoop]: Abstraction has 1589 states and 5206 transitions. [2022-03-15 19:52:05,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:05,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 5206 transitions. [2022-03-15 19:52:05,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:52:05,792 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:52:05,792 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2022-03-15 19:52:05,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-03-15 19:52:05,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-03-15 19:52:05,998 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:52:05,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:52:05,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1427223388, now seen corresponding path program 20 times [2022-03-15 19:52:06,000 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:52:06,000 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677698278] [2022-03-15 19:52:06,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:52:06,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:52:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:52:07,393 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:07,393 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:52:07,393 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677698278] [2022-03-15 19:52:07,393 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677698278] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:52:07,393 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450991371] [2022-03-15 19:52:07,393 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:52:07,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:07,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:52:07,395 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:52:07,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-03-15 19:52:07,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:52:07,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:52:07,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 56 conjunts are in the unsatisfiable core [2022-03-15 19:52:07,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:52:07,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:52:07,838 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:52:07,902 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:52:08,066 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-03-15 19:52:08,137 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:52:08,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:52:08,256 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:52:08,257 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 37 [2022-03-15 19:52:08,557 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:52:08,558 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 155 treesize of output 131 [2022-03-15 19:52:08,562 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 110 treesize of output 98 [2022-03-15 19:52:08,565 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 98 treesize of output 86 [2022-03-15 19:52:08,840 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 19:52:08,840 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450991371] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:52:08,840 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:52:08,840 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 9] total 37 [2022-03-15 19:52:08,840 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2090704041] [2022-03-15 19:52:08,840 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:52:08,843 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:52:08,893 INFO L252 McrAutomatonBuilder]: Finished intersection with 77 states and 137 transitions. [2022-03-15 19:52:08,893 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:52:17,238 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [154598#(and (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (= ~q2~0.offset 0) (< ~q2_back~0 0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< 0 (+ 1 ~q2_front~0)) (< ~q2_back~0 0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~N~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (< ~q2_back~0 0))), 154596#(and (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (= ~t~0 0) (<= ~n1~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (< 0 (+ 1 ~q2_front~0))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (= ~q2~0.offset 0))), 154597#(and (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< 0 (+ 1 ~q2_front~0)) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~N~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (= ~q2~0.offset 0) (< ~q2_back~0 0))), 154595#(and (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~t~0 ~N~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~t~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (= ~q2~0.offset 0))), 154594#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= ~q2~0.offset 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4)))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (+ 1 ~q2_front~0))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4)))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~N~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (= ~t~0 0))), 154600#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~t~0 (+ ~N~0 1)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= ~N~0 ~t~0))), 154599#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (<= ~N~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (< 0 (+ 1 ~q2_front~0)) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (= ~t~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (= ~q2~0.offset 0) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), 154593#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= ~q2~0.offset 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~N~0 ~t~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~t~0 ~N~0)))] [2022-03-15 19:52:17,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 19:52:17,238 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:52:17,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 19:52:17,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1963, Unknown=2, NotChecked=0, Total=2162 [2022-03-15 19:52:17,239 INFO L87 Difference]: Start difference. First operand 1589 states and 5206 transitions. Second operand has 28 states, 27 states have (on average 2.740740740740741) internal successors, (74), 27 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:20,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:52:20,673 INFO L93 Difference]: Finished difference Result 1954 states and 6018 transitions. [2022-03-15 19:52:20,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:52:20,673 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.740740740740741) internal successors, (74), 27 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:52:20,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:52:20,677 INFO L225 Difference]: With dead ends: 1954 [2022-03-15 19:52:20,677 INFO L226 Difference]: Without dead ends: 1933 [2022-03-15 19:52:20,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 70 SyntacticMatches, 8 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=312, Invalid=3226, Unknown=2, NotChecked=0, Total=3540 [2022-03-15 19:52:20,677 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 133 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 1710 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 1771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:52:20,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 170 Invalid, 1771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1710 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 19:52:20,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2022-03-15 19:52:20,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1560. [2022-03-15 19:52:20,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 1559 states have (on average 3.2751763951250803) internal successors, (5106), 1559 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:20,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 5106 transitions. [2022-03-15 19:52:20,707 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 5106 transitions. Word has length 31 [2022-03-15 19:52:20,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:52:20,707 INFO L470 AbstractCegarLoop]: Abstraction has 1560 states and 5106 transitions. [2022-03-15 19:52:20,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.740740740740741) internal successors, (74), 27 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:20,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 5106 transitions. [2022-03-15 19:52:20,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:52:20,710 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:52:20,710 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2022-03-15 19:52:20,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-03-15 19:52:20,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-03-15 19:52:20,923 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:52:20,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:52:20,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1287428576, now seen corresponding path program 21 times [2022-03-15 19:52:20,925 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:52:20,925 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067674376] [2022-03-15 19:52:20,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:52:20,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:52:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:52:23,047 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:23,047 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:52:23,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067674376] [2022-03-15 19:52:23,047 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067674376] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:52:23,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134140253] [2022-03-15 19:52:23,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:52:23,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:23,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:52:23,048 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:52:23,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-03-15 19:52:23,259 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:52:23,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:52:23,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 56 conjunts are in the unsatisfiable core [2022-03-15 19:52:23,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:52:23,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:52:23,643 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:52:23,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:52:23,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:52:23,943 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-15 19:52:23,943 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 40 [2022-03-15 19:52:24,051 INFO L353 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-03-15 19:52:24,052 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 14 [2022-03-15 19:52:24,139 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 19:52:24,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:52:24,243 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2794 (Array Int Int))) (<= c_~N~0 (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2794) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4)))))) (forall ((v_ArrVal_2794 (Array Int Int))) (< (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2794) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (+ c_~N~0 1)))) is different from false [2022-03-15 19:52:24,269 WARN L838 $PredicateComparison]: unable to prove that (forall ((~q2~0.offset Int)) (or (and (forall ((v_ArrVal_2794 (Array Int Int))) (< (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2794) c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_front~0 4)))) (+ c_~N~0 1))) (forall ((v_ArrVal_2794 (Array Int Int))) (<= c_~N~0 (+ c_~t~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2794) c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_front~0 4))))))) (not (= |c_thread2Thread1of1ForFork2_~j~0#1| (select (select |c_#memory_int| c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_back~0 4))))))) is different from false [2022-03-15 19:52:24,578 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:52:24,578 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 362 treesize of output 406 [2022-03-15 19:52:24,607 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:52:24,608 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 406 treesize of output 412 [2022-03-15 19:52:24,620 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 205 treesize of output 181 [2022-03-15 19:52:24,628 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 181 treesize of output 169 [2022-03-15 19:52:26,647 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [2022-03-15 19:52:26,647 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134140253] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:52:26,647 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:52:26,647 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 11] total 41 [2022-03-15 19:52:26,647 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1450264453] [2022-03-15 19:52:26,647 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:52:26,650 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:52:26,663 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 61 transitions. [2022-03-15 19:52:26,663 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:52:27,619 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [159924#(and (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= 0 ~q2_front~0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (= ~t~0 0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (= ~q2~0.offset 0) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 1) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= ~q2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (= ~q1~0.offset 0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) (< ~q1_back~0 0))), 159925#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~t~0 (+ ~N~0 1)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= ~N~0 ~t~0)))] [2022-03-15 19:52:27,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:52:27,620 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:52:27,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:52:27,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1660, Unknown=4, NotChecked=166, Total=1980 [2022-03-15 19:52:27,620 INFO L87 Difference]: Start difference. First operand 1560 states and 5106 transitions. Second operand has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:29,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:52:29,970 INFO L93 Difference]: Finished difference Result 2040 states and 6529 transitions. [2022-03-15 19:52:29,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 19:52:29,970 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:52:29,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:52:29,973 INFO L225 Difference]: With dead ends: 2040 [2022-03-15 19:52:29,974 INFO L226 Difference]: Without dead ends: 2019 [2022-03-15 19:52:29,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 42 SyntacticMatches, 9 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=194, Invalid=2360, Unknown=4, NotChecked=198, Total=2756 [2022-03-15 19:52:29,974 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 92 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 1564 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 1615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:52:29,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 193 Invalid, 1615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1564 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 19:52:29,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2019 states. [2022-03-15 19:52:29,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2019 to 1537. [2022-03-15 19:52:29,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1537 states, 1536 states have (on average 3.2838541666666665) internal successors, (5044), 1536 states have internal predecessors, (5044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:30,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1537 states and 5044 transitions. [2022-03-15 19:52:30,002 INFO L78 Accepts]: Start accepts. Automaton has 1537 states and 5044 transitions. Word has length 31 [2022-03-15 19:52:30,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:52:30,003 INFO L470 AbstractCegarLoop]: Abstraction has 1537 states and 5044 transitions. [2022-03-15 19:52:30,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:30,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 5044 transitions. [2022-03-15 19:52:30,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:52:30,006 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:52:30,006 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2022-03-15 19:52:30,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-03-15 19:52:30,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:30,227 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:52:30,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:52:30,227 INFO L85 PathProgramCache]: Analyzing trace with hash -729932584, now seen corresponding path program 22 times [2022-03-15 19:52:30,228 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:52:30,228 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8500350] [2022-03-15 19:52:30,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:52:30,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:52:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:52:31,283 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:31,284 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:52:31,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8500350] [2022-03-15 19:52:31,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8500350] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:52:31,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815374984] [2022-03-15 19:52:31,284 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:52:31,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:31,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:52:31,285 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:52:31,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-03-15 19:52:31,477 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:52:31,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:52:31,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 67 conjunts are in the unsatisfiable core [2022-03-15 19:52:31,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:52:31,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:52:31,890 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:52:31,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:52:31,981 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:52:32,931 INFO L353 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-03-15 19:52:32,931 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 44 treesize of output 10 [2022-03-15 19:52:33,002 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:52:33,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:52:33,732 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:52:33,733 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1162 treesize of output 1102 [2022-03-15 19:52:33,771 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:52:33,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 990 treesize of output 798 [2022-03-15 19:52:33,796 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:52:33,797 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 708 treesize of output 636 [2022-03-15 19:52:45,537 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:52:45,537 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815374984] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:52:45,537 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:52:45,538 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 14] total 46 [2022-03-15 19:52:45,538 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [612341203] [2022-03-15 19:52:45,538 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:52:45,541 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:52:45,565 INFO L252 McrAutomatonBuilder]: Finished intersection with 89 states and 162 transitions. [2022-03-15 19:52:45,565 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:53:05,448 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [165285#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (+ ~N~0 1)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))), 165290#(and (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~N~0 1) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= ~q2~0.offset 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q2_front~0 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= 0 ~q2_front~0) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (= ~t~0 0) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 165286#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4)) 0)) (<= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4)))) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (<= ~q2_back~0 (+ 1 ~q2_front~0))) (or (< (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4))) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4)) 0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (<= ~q2_back~0 (+ 1 ~q2_front~0)))), 165288#(and (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= ~q2~0.offset 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= ~t~0 0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 0 ~q2_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (<= ~n1~0 ~q1_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q2_front~0 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~N~0 1) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 165291#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (<= ~q2_front~0 0) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (<= ~n2~0 (+ ~q2_back~0 1)) (<= ~N~0 1) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~t~0 0) (<= ~n1~0 ~q1_back~0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (<= ~n2~0 (+ ~q2_back~0 1)) (= ~q2~0.offset 0) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (<= ~n1~0 ~q1_back~0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 0 ~q2_front~0) (<= ~n1~0 ~q1_back~0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (< ~q2_back~0 0))), 165289#(and (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 1) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (= ~q2~0.offset 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n2~0 ~q2_back~0) (<= 0 ~q2_front~0) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (<= ~q2_front~0 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n2~0 ~q2_back~0) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 165287#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (<= 0 ~q2_front~0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (<= ~N~0 1) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= ~q2~0.offset 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (<= ~q2_front~0 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 165292#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (<= 0 ~q2_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (= ~q2~0.offset 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~N~0 1) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= (* ~n2~0 4) (+ 7 ~q2~0.offset (* ~q2_back~0 4))) (<= ~n2~0 ~q2_back~0) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0))), 165284#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~N~0 1) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (= ~t~0 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (<= 0 ~q2_front~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (= ~q2~0.offset 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~q2_front~0 0) (< ~q2_back~0 0)))] [2022-03-15 19:53:05,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 19:53:05,448 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:53:05,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 19:53:05,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=2841, Unknown=8, NotChecked=0, Total=3192 [2022-03-15 19:53:05,449 INFO L87 Difference]: Start difference. First operand 1537 states and 5044 transitions. Second operand has 28 states, 27 states have (on average 2.925925925925926) internal successors, (79), 27 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:18,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:53:18,452 INFO L93 Difference]: Finished difference Result 3156 states and 10258 transitions. [2022-03-15 19:53:18,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-15 19:53:18,453 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.925925925925926) internal successors, (79), 27 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:53:18,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:53:18,459 INFO L225 Difference]: With dead ends: 3156 [2022-03-15 19:53:18,459 INFO L226 Difference]: Without dead ends: 3094 [2022-03-15 19:53:18,459 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1618 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=846, Invalid=7517, Unknown=9, NotChecked=0, Total=8372 [2022-03-15 19:53:18,460 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 287 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 2236 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 2388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 2236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:53:18,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 288 Invalid, 2388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 2236 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 19:53:18,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2022-03-15 19:53:18,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 1557. [2022-03-15 19:53:18,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1556 states have (on average 3.2724935732647813) internal successors, (5092), 1556 states have internal predecessors, (5092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:18,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 5092 transitions. [2022-03-15 19:53:18,486 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 5092 transitions. Word has length 31 [2022-03-15 19:53:18,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:53:18,486 INFO L470 AbstractCegarLoop]: Abstraction has 1557 states and 5092 transitions. [2022-03-15 19:53:18,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.925925925925926) internal successors, (79), 27 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:18,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 5092 transitions. [2022-03-15 19:53:18,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:53:18,488 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:53:18,488 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2022-03-15 19:53:18,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-03-15 19:53:18,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-03-15 19:53:18,689 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:53:18,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:53:18,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1462697504, now seen corresponding path program 23 times [2022-03-15 19:53:18,691 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:53:18,691 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518802788] [2022-03-15 19:53:18,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:53:18,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:53:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:53:20,043 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:53:20,043 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:53:20,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518802788] [2022-03-15 19:53:20,044 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518802788] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:53:20,044 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186826268] [2022-03-15 19:53:20,044 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:53:20,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:53:20,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:53:20,045 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:53:20,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-03-15 19:53:20,242 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:53:20,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:53:20,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 60 conjunts are in the unsatisfiable core [2022-03-15 19:53:20,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:53:20,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:53:20,566 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:53:20,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:53:20,641 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:53:21,109 INFO L353 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2022-03-15 19:53:21,109 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 46 [2022-03-15 19:53:21,289 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:53:21,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:53:24,804 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:53:24,805 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 663 treesize of output 675 [2022-03-15 19:53:24,835 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:53:24,835 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 563 treesize of output 479 [2022-03-15 19:53:24,862 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:53:24,863 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 410 treesize of output 392 [2022-03-15 19:53:36,145 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:53:36,146 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186826268] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:53:36,146 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:53:36,146 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 45 [2022-03-15 19:53:36,146 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1965084921] [2022-03-15 19:53:36,146 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:53:36,149 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:53:36,173 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 157 transitions. [2022-03-15 19:53:36,174 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:53:54,020 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [171862#(and (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= (* ~n2~0 4) (+ (* 4 ~q2_front~0) 7 ~q2~0.offset)) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~q2_front~0 ~q2_back~0) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= (* ~n2~0 4) (+ (* 4 ~q2_front~0) 7 ~q2~0.offset)) (<= ~N~0 1) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= (* ~n2~0 4) (+ (* 4 ~q2_front~0) 7 ~q2~0.offset)) (<= (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) ~N~0) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (= ~q2~0.offset 0) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (<= ~n2~0 2) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= (* ~n2~0 4) (+ (* 4 ~q2_front~0) 7 ~q2~0.offset)) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (<= 0 ~q2_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0))), 171866#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~q2_front~0 ~q2_back~0) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (= ~q2~0.offset 0) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (<= ~n1~0 ~q1_back~0) (<= (* ~n2~0 4) (+ (* 4 ~q2_front~0) 7 ~q2~0.offset)) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (<= (* ~n2~0 4) (+ (* 4 ~q2_front~0) 7 ~q2~0.offset)) (<= (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) ~N~0) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n2~0 ~q2_back~0) (<= 0 ~q2_front~0) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n2~0 ~q2_back~0) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (<= ~n1~0 ~q1_back~0) (<= (* ~n2~0 4) (+ (* 4 ~q2_front~0) 7 ~q2~0.offset)) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (<= (* ~n2~0 4) (+ (* 4 ~q2_front~0) 7 ~q2~0.offset)) (<= ~N~0 1) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (<= ~n2~0 2) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (< ~q2_back~0 0))), 171860#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= ~q2~0.offset 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~q2_front~0 ~q2_back~0) (<= ~N~0 ~t~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~q2_front~0 ~q2_back~0) (<= ~t~0 ~N~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= (* ~n2~0 4) (+ (* 4 ~q2_front~0) ~q2~0.offset 3)) (<= ~n1~0 ~q1_front~0) (<= ~t~0 ~N~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= (* ~n2~0 4) (+ (* 4 ~q2_front~0) ~q2~0.offset 3)) (<= ~n1~0 ~q1_front~0) (<= ~N~0 ~t~0))), 171868#(and (or (<= ~n2~0 2) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= (* ~n2~0 4) (+ (* 4 ~q2_front~0) 7 ~q2~0.offset)) (<= ~N~0 1) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= (* ~n2~0 4) (+ (* 4 ~q2_front~0) 7 ~q2~0.offset)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (<= 0 ~q2_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= (* ~n2~0 4) (+ (* 4 ~q2_front~0) 7 ~q2~0.offset)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~q2_front~0 ~q2_back~0) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (= ~q2~0.offset 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) ~N~0) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= (* ~n2~0 4) (+ (* 4 ~q2_front~0) 7 ~q2~0.offset)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (= ~q1~0.offset 0) (<= ~n2~0 ~q2_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0))), 171861#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= ~q2~0.offset 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ (* 4 ~q2_front~0) 7 ~q2~0.offset)) (<= (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) ~N~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= ~n1~0 ~q1_front~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= ~t~0 0) (<= (* ~n2~0 4) (+ (* 4 ~q2_front~0) 7 ~q2~0.offset))) (or (<= ~q1_back~0 ~q1_front~0) (<= ~n2~0 2) (< ~q1_front~0 0) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= ~n1~0 ~q1_front~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ (* 4 ~q2_front~0) 7 ~q2~0.offset)) (<= ~N~0 1)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 0 ~q2_front~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (<= (* ~n2~0 4) (+ (* 4 ~q2_front~0) 7 ~q2~0.offset)))), 171867#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (+ ~N~0 1)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))), 171863#(and (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~q2_front~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (<= ~t~0 ~N~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= (* ~n2~0 4) (+ (* 4 ~q2_front~0) ~q2~0.offset 3)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~t~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= (* ~n2~0 4) (+ (* 4 ~q2_front~0) ~q2~0.offset 3)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (<= ~t~0 ~N~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (= ~q2~0.offset 0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~q2_front~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~t~0))), 171865#(and (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (= ~q2~0.offset 0) (< ~q2_back~0 0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= (* ~n2~0 4) (+ (* 4 ~q2_front~0) 7 ~q2~0.offset)) (<= ~N~0 1) (< ~q2_back~0 0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= (* ~n2~0 4) (+ (* 4 ~q2_front~0) 7 ~q2~0.offset)) (< ~q2_back~0 0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (<= ~n2~0 2) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n2~0 ~q2_back~0) (<= 0 ~q2_front~0) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~q2_front~0 ~q2_back~0) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (< ~q2_back~0 0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= (* ~n2~0 4) (+ (* 4 ~q2_front~0) 7 ~q2~0.offset)) (<= (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) ~N~0) (< ~q2_back~0 0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n2~0 ~q2_back~0) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (<= ~n1~0 ~q1_back~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= (* ~n2~0 4) (+ (* 4 ~q2_front~0) 7 ~q2~0.offset)) (< ~q2_back~0 0))), 171864#(and (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= ~n1~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= 0 ~q2_front~0) (<= ~n1~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (<= (* ~n2~0 4) (+ (* 4 ~q2_front~0) 7 ~q2~0.offset)) (<= (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) ~N~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (<= (* ~n2~0 4) (+ (* 4 ~q2_front~0) 7 ~q2~0.offset)) (<= ~N~0 1)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (= ~t~0 0) (<= ~n1~0 ~q1_back~0) (<= (* ~n2~0 4) (+ (* 4 ~q2_front~0) 7 ~q2~0.offset))) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (<= ~n2~0 2) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (<= ~n1~0 ~q1_back~0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= ~n1~0 ~q1_back~0) (= ~q2~0.offset 0)) (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (<= 1 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (<= ~n1~0 ~q1_back~0) (<= (* ~n2~0 4) (+ (* 4 ~q2_front~0) 7 ~q2~0.offset))))] [2022-03-15 19:53:54,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 19:53:54,021 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:53:54,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 19:53:54,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=2834, Unknown=8, NotChecked=0, Total=3080 [2022-03-15 19:53:54,021 INFO L87 Difference]: Start difference. First operand 1557 states and 5092 transitions. Second operand has 29 states, 28 states have (on average 2.857142857142857) internal successors, (80), 28 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:58,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:53:58,673 INFO L93 Difference]: Finished difference Result 2158 states and 6779 transitions. [2022-03-15 19:53:58,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 19:53:58,673 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.857142857142857) internal successors, (80), 28 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:53:58,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:53:58,677 INFO L225 Difference]: With dead ends: 2158 [2022-03-15 19:53:58,677 INFO L226 Difference]: Without dead ends: 2133 [2022-03-15 19:53:58,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 69 SyntacticMatches, 10 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1310 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=491, Invalid=5507, Unknown=8, NotChecked=0, Total=6006 [2022-03-15 19:53:58,677 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 173 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 1693 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 1805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:53:58,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 199 Invalid, 1805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1693 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 19:53:58,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2133 states. [2022-03-15 19:53:58,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2133 to 1486. [2022-03-15 19:53:58,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1486 states, 1485 states have (on average 3.2707070707070707) internal successors, (4857), 1485 states have internal predecessors, (4857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:58,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 4857 transitions. [2022-03-15 19:53:58,698 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 4857 transitions. Word has length 31 [2022-03-15 19:53:58,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:53:58,698 INFO L470 AbstractCegarLoop]: Abstraction has 1486 states and 4857 transitions. [2022-03-15 19:53:58,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.857142857142857) internal successors, (80), 28 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:58,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 4857 transitions. [2022-03-15 19:53:58,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:53:58,700 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:53:58,700 INFO L514 BasicCegarLoop]: trace histogram [4, 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] [2022-03-15 19:53:58,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-03-15 19:53:58,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-03-15 19:53:58,901 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:53:58,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:53:58,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1778789301, now seen corresponding path program 7 times [2022-03-15 19:53:58,902 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:53:58,902 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066825469] [2022-03-15 19:53:58,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:53:58,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:53:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:53:59,585 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:53:59,585 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:53:59,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066825469] [2022-03-15 19:53:59,586 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066825469] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:53:59,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152987780] [2022-03-15 19:53:59,586 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:53:59,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:53:59,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:53:59,589 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:53:59,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-03-15 19:53:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:53:59,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 19:53:59,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:53:59,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:53:59,957 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:53:59,990 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 19:53:59,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:54:00,010 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2995 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2995) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 0))) is different from false [2022-03-15 19:54:00,023 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:54:00,023 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 44 treesize of output 44 [2022-03-15 19:54:00,025 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-03-15 19:54:00,175 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 2 not checked. [2022-03-15 19:54:00,175 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152987780] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:54:00,175 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:54:00,176 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 6] total 26 [2022-03-15 19:54:00,176 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [529879374] [2022-03-15 19:54:00,176 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:54:00,179 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:54:00,188 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 51 transitions. [2022-03-15 19:54:00,188 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:54:00,305 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [177250#(or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))] [2022-03-15 19:54:00,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:54:00,305 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:54:00,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:54:00,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=615, Unknown=1, NotChecked=50, Total=756 [2022-03-15 19:54:00,306 INFO L87 Difference]: Start difference. First operand 1486 states and 4857 transitions. Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:01,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:54:01,511 INFO L93 Difference]: Finished difference Result 2583 states and 8393 transitions. [2022-03-15 19:54:01,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 19:54:01,512 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:54:01,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:54:01,516 INFO L225 Difference]: With dead ends: 2583 [2022-03-15 19:54:01,516 INFO L226 Difference]: Without dead ends: 2583 [2022-03-15 19:54:01,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=191, Invalid=1218, Unknown=1, NotChecked=72, Total=1482 [2022-03-15 19:54:01,517 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 185 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:54:01,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 60 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:54:01,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2022-03-15 19:54:01,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 1691. [2022-03-15 19:54:01,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 1690 states have (on average 3.2840236686390534) internal successors, (5550), 1690 states have internal predecessors, (5550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:01,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 5550 transitions. [2022-03-15 19:54:01,558 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 5550 transitions. Word has length 31 [2022-03-15 19:54:01,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:54:01,558 INFO L470 AbstractCegarLoop]: Abstraction has 1691 states and 5550 transitions. [2022-03-15 19:54:01,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:01,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 5550 transitions. [2022-03-15 19:54:01,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:54:01,561 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:54:01,561 INFO L514 BasicCegarLoop]: trace histogram [4, 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] [2022-03-15 19:54:01,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-03-15 19:54:01,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-03-15 19:54:01,761 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:54:01,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:54:01,763 INFO L85 PathProgramCache]: Analyzing trace with hash -731334977, now seen corresponding path program 8 times [2022-03-15 19:54:01,764 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:54:01,764 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466599180] [2022-03-15 19:54:01,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:54:01,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:54:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:54:02,748 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:02,748 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:54:02,748 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466599180] [2022-03-15 19:54:02,748 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466599180] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:54:02,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269029822] [2022-03-15 19:54:02,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:54:02,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:54:02,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:54:02,750 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:54:02,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-03-15 19:54:02,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:54:02,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:54:02,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 19:54:02,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:54:03,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:54:03,126 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-03-15 19:54:03,158 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 19:54:03,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:54:03,178 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3064 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_3064) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 0))) is different from false [2022-03-15 19:54:03,189 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:54:03,189 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 44 treesize of output 44 [2022-03-15 19:54:03,191 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-03-15 19:54:03,332 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 1 not checked. [2022-03-15 19:54:03,332 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269029822] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:54:03,332 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:54:03,332 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 6] total 26 [2022-03-15 19:54:03,332 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [266368327] [2022-03-15 19:54:03,332 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:54:03,335 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:54:03,345 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 49 transitions. [2022-03-15 19:54:03,345 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:54:03,469 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:54:03,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:54:03,470 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:54:03,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:54:03,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=577, Unknown=1, NotChecked=48, Total=702 [2022-03-15 19:54:03,470 INFO L87 Difference]: Start difference. First operand 1691 states and 5550 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:04,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:54:04,480 INFO L93 Difference]: Finished difference Result 2425 states and 7886 transitions. [2022-03-15 19:54:04,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:54:04,480 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:54:04,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:54:04,484 INFO L225 Difference]: With dead ends: 2425 [2022-03-15 19:54:04,484 INFO L226 Difference]: Without dead ends: 2393 [2022-03-15 19:54:04,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=172, Invalid=1091, Unknown=1, NotChecked=68, Total=1332 [2022-03-15 19:54:04,485 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 193 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:54:04,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 40 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:54:04,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2022-03-15 19:54:04,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 1486. [2022-03-15 19:54:04,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1486 states, 1485 states have (on average 3.2707070707070707) internal successors, (4857), 1485 states have internal predecessors, (4857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:04,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 4857 transitions. [2022-03-15 19:54:04,505 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 4857 transitions. Word has length 31 [2022-03-15 19:54:04,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:54:04,505 INFO L470 AbstractCegarLoop]: Abstraction has 1486 states and 4857 transitions. [2022-03-15 19:54:04,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:04,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 4857 transitions. [2022-03-15 19:54:04,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:54:04,508 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:54:04,508 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2022-03-15 19:54:04,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-03-15 19:54:04,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:54:04,708 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:54:04,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:54:04,709 INFO L85 PathProgramCache]: Analyzing trace with hash 950838166, now seen corresponding path program 24 times [2022-03-15 19:54:04,709 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:54:04,710 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186305935] [2022-03-15 19:54:04,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:54:04,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:54:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:54:06,467 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:06,467 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:54:06,467 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186305935] [2022-03-15 19:54:06,467 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186305935] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:54:06,467 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007032590] [2022-03-15 19:54:06,467 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:54:06,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:54:06,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:54:06,468 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:54:06,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-03-15 19:54:06,672 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:54:06,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:54:06,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 19:54:06,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:54:07,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:54:07,206 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:54:07,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:54:07,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:54:07,479 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-15 19:54:07,479 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 42 [2022-03-15 19:54:12,215 INFO L353 Elim1Store]: treesize reduction 21, result has 4.5 percent of original size [2022-03-15 19:54:12,216 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 18 [2022-03-15 19:54:12,264 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:54:12,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:54:12,400 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3130 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_3130) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))))) (or (= .cse0 0) (let ((.cse1 (+ c_~t~0 .cse0))) (and (<= c_~N~0 .cse1) (< .cse1 (+ c_~N~0 1))))))) is different from false [2022-03-15 19:54:12,599 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3130 (Array Int Int)) (~q2~0.offset Int)) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_3130) c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_front~0 4))))) (or (= 0 .cse0) (let ((.cse1 (+ c_~t~0 .cse0))) (and (< .cse1 (+ c_~N~0 1)) (<= c_~N~0 .cse1))) (not (= (select (select |c_#memory_int| c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_back~0 4))) (select (select |c_#memory_int| c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset))))))) is different from false [2022-03-15 19:54:12,770 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3130 (Array Int Int)) (~q2~0.offset Int) (v_ArrVal_3129 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3129))) (let ((.cse1 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_3130) c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_front~0 4))))) (or (not (= (select (select .cse0 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (select (select .cse0 c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_back~0 4))))) (= .cse1 0) (let ((.cse2 (+ c_~t~0 .cse1))) (and (< .cse2 (+ c_~N~0 1)) (<= c_~N~0 .cse2))))))) is different from false [2022-03-15 19:54:12,919 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:54:12,920 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 601 treesize of output 621 [2022-03-15 19:54:12,944 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:54:12,944 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 509 treesize of output 497 [2022-03-15 19:54:12,953 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 403 treesize of output 331 [2022-03-15 19:54:14,933 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [2022-03-15 19:54:14,933 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007032590] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:54:14,933 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:54:14,933 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 11] total 43 [2022-03-15 19:54:14,933 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1834647472] [2022-03-15 19:54:14,933 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:54:14,969 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:54:14,983 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 61 transitions. [2022-03-15 19:54:14,983 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:54:15,622 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [189088#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4)) 0)) (<= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4)))) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (<= ~q2_back~0 (+ 1 ~q2_front~0))) (or (< (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4))) (+ ~N~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4)) 0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (<= ~q2_back~0 (+ 1 ~q2_front~0)))), 189087#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (+ ~N~0 1)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))))] [2022-03-15 19:54:15,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:54:15,623 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:54:15,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:54:15,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1726, Unknown=6, NotChecked=258, Total=2162 [2022-03-15 19:54:15,623 INFO L87 Difference]: Start difference. First operand 1486 states and 4857 transitions. Second operand has 23 states, 22 states have (on average 2.0) internal successors, (44), 22 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:19,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:54:19,744 INFO L93 Difference]: Finished difference Result 1752 states and 5551 transitions. [2022-03-15 19:54:19,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:54:19,745 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 22 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:54:19,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:54:19,748 INFO L225 Difference]: With dead ends: 1752 [2022-03-15 19:54:19,748 INFO L226 Difference]: Without dead ends: 1737 [2022-03-15 19:54:19,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=246, Invalid=2411, Unknown=7, NotChecked=306, Total=2970 [2022-03-15 19:54:19,750 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 107 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:54:19,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 186 Invalid, 1267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1241 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:54:19,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1737 states. [2022-03-15 19:54:19,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1737 to 1582. [2022-03-15 19:54:19,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1581 states have (on average 3.2333965844402277) internal successors, (5112), 1581 states have internal predecessors, (5112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:19,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 5112 transitions. [2022-03-15 19:54:19,771 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 5112 transitions. Word has length 31 [2022-03-15 19:54:19,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:54:19,772 INFO L470 AbstractCegarLoop]: Abstraction has 1582 states and 5112 transitions. [2022-03-15 19:54:19,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 22 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:19,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 5112 transitions. [2022-03-15 19:54:19,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:54:19,775 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:54:19,775 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2022-03-15 19:54:19,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-03-15 19:54:19,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:54:19,988 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:54:19,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:54:19,988 INFO L85 PathProgramCache]: Analyzing trace with hash 7743138, now seen corresponding path program 25 times [2022-03-15 19:54:19,989 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:54:19,989 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678966441] [2022-03-15 19:54:19,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:54:19,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:54:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:54:21,487 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:21,488 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:54:21,488 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678966441] [2022-03-15 19:54:21,488 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678966441] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:54:21,488 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264217301] [2022-03-15 19:54:21,488 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:54:21,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:54:21,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:54:21,489 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:54:21,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-03-15 19:54:21,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:54:21,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 62 conjunts are in the unsatisfiable core [2022-03-15 19:54:21,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:54:22,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:54:22,165 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:54:22,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:54:22,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:54:22,407 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-15 19:54:22,407 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 40 [2022-03-15 19:54:22,518 INFO L353 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-03-15 19:54:22,518 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 10 [2022-03-15 19:54:22,600 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:54:22,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:54:22,730 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3196 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_3196) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))))) (or (let ((.cse0 (+ c_~t~0 .cse1))) (and (<= c_~N~0 .cse0) (< .cse0 (+ c_~N~0 1)))) (= .cse1 0)))) is different from false [2022-03-15 19:54:22,897 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3196 (Array Int Int)) (~q2~0.offset Int)) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_3196) c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_front~0 4))))) (or (let ((.cse0 (+ .cse1 c_~t~0))) (and (<= c_~N~0 .cse0) (< .cse0 (+ c_~N~0 1)))) (= .cse1 0) (not (= (select (select |c_#memory_int| c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_back~0 4))) (select (select |c_#memory_int| c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset))))))) is different from false [2022-03-15 19:54:23,045 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3196 (Array Int Int)) (~q2~0.offset Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3195))) (let ((.cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_3196) c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_front~0 4))))) (or (= .cse0 0) (let ((.cse1 (+ c_~t~0 .cse0))) (and (<= c_~N~0 .cse1) (< .cse1 (+ c_~N~0 1)))) (not (= (select (select .cse2 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (select (select .cse2 c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_back~0 4))))))))) is different from false [2022-03-15 19:54:23,190 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:54:23,191 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 343 treesize of output 387 [2022-03-15 19:54:23,213 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:54:23,213 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 248 treesize of output 254 [2022-03-15 19:54:23,220 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 187 treesize of output 151 [2022-03-15 19:54:24,630 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-03-15 19:54:24,630 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264217301] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:54:24,630 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:54:24,630 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 11] total 42 [2022-03-15 19:54:24,630 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [125776542] [2022-03-15 19:54:24,630 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:54:24,635 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:54:24,650 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 59 transitions. [2022-03-15 19:54:24,650 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:54:25,236 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [194245#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (+ ~N~0 1)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))))] [2022-03-15 19:54:25,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:54:25,237 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:54:25,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:54:25,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1594, Unknown=3, NotChecked=246, Total=1980 [2022-03-15 19:54:25,237 INFO L87 Difference]: Start difference. First operand 1582 states and 5112 transitions. Second operand has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:27,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:54:27,558 INFO L93 Difference]: Finished difference Result 1770 states and 5605 transitions. [2022-03-15 19:54:27,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:54:27,558 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:54:27,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:54:27,561 INFO L225 Difference]: With dead ends: 1770 [2022-03-15 19:54:27,561 INFO L226 Difference]: Without dead ends: 1749 [2022-03-15 19:54:27,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=184, Invalid=2275, Unknown=3, NotChecked=294, Total=2756 [2022-03-15 19:54:27,562 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 115 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:54:27,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 162 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1241 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:54:27,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2022-03-15 19:54:27,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 1534. [2022-03-15 19:54:27,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1534 states, 1533 states have (on average 3.253750815394651) internal successors, (4988), 1533 states have internal predecessors, (4988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:27,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 4988 transitions. [2022-03-15 19:54:27,579 INFO L78 Accepts]: Start accepts. Automaton has 1534 states and 4988 transitions. Word has length 31 [2022-03-15 19:54:27,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:54:27,579 INFO L470 AbstractCegarLoop]: Abstraction has 1534 states and 4988 transitions. [2022-03-15 19:54:27,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:27,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 4988 transitions. [2022-03-15 19:54:27,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:54:27,581 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:54:27,581 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2022-03-15 19:54:27,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-03-15 19:54:27,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:54:27,782 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:54:27,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:54:27,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1120891600, now seen corresponding path program 26 times [2022-03-15 19:54:27,783 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:54:27,783 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785026985] [2022-03-15 19:54:27,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:54:27,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:54:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:54:29,842 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:29,843 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:54:29,843 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785026985] [2022-03-15 19:54:29,843 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785026985] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:54:29,843 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239254866] [2022-03-15 19:54:29,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:54:29,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:54:29,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:54:29,844 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:54:29,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-03-15 19:54:30,050 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:54:30,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:54:30,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 61 conjunts are in the unsatisfiable core [2022-03-15 19:54:30,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:54:30,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:54:30,421 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:54:30,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:54:30,493 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:54:32,457 INFO L353 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-03-15 19:54:32,457 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 44 treesize of output 10 [2022-03-15 19:54:32,525 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:54:32,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:54:32,960 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3262 (Array Int Int)) (~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_3262))) (let ((.cse1 (select .cse0 ~q2~0.base))) (let ((.cse2 (select .cse1 (+ ~q2~0.offset (* c_~q2_front~0 4))))) (or (not (= (select (select .cse0 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (select .cse1 (+ ~q2~0.offset (* c_~q2_back~0 4))))) (= .cse2 0) (let ((.cse3 (+ .cse2 c_~t~0))) (and (<= .cse3 c_~N~0) (<= c_~N~0 .cse3)))))))) is different from false [2022-03-15 19:54:33,032 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3261 (Array Int Int)) (v_ArrVal_3262 (Array Int Int)) (~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3261) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_3262))) (let ((.cse3 (select .cse2 ~q2~0.base))) (let ((.cse0 (select .cse3 (+ ~q2~0.offset (* c_~q2_front~0 4))))) (or (= .cse0 0) (let ((.cse1 (+ c_~t~0 .cse0))) (and (<= c_~N~0 .cse1) (<= .cse1 c_~N~0))) (not (= (select (select .cse2 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (select .cse3 (+ ~q2~0.offset (* c_~q2_back~0 4)))))))))) is different from false [2022-03-15 19:54:33,149 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:54:33,150 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 655 treesize of output 667 [2022-03-15 19:54:33,174 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:54:33,175 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 528 treesize of output 510 [2022-03-15 19:54:33,197 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:54:33,197 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 489 treesize of output 405 [2022-03-15 19:55:04,146 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 19:55:04,146 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239254866] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:55:04,146 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:55:04,146 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 10] total 39 [2022-03-15 19:55:04,146 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1529848938] [2022-03-15 19:55:04,147 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:55:04,150 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:55:04,172 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 158 transitions. [2022-03-15 19:55:04,172 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:55:23,133 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [199321#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (<= ~N~0 1) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (< ~q2_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (= ~t~0 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (<= ~q2_front~0 1) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= 1 ~N~0) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (= ~q2~0.offset 0) (< ~q2_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| 0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) (< ~q2_back~0 0))), 199323#(and (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= ~q2~0.offset 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= 1 ~N~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= ~t~0 0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~q2_front~0 1) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) |thread2Thread1of1ForFork2_~j~0#1|)) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= |thread2Thread1of1ForFork2_~j~0#1| 0) (<= ~n2~0 (+ ~q2_back~0 1)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~N~0 1) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 199324#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~q2_front~0 0) (<= ~t~0 ~N~0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= ~N~0 ~t~0))), 199322#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (<= ~q2_front~0 1) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (< ~q2_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (<= ~N~0 1) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= ~q2~0.offset 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= 1 ~N~0) (<= ~n2~0 ~q2_back~0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (< ~q2_back~0 0) (not (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 199325#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4)) 0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (<= (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) ~N~0) (<= ~q2_back~0 (+ 1 ~q2_front~0))) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset 4)) 0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= ~n2~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (<= ~q2_back~0 (+ 1 ~q2_front~0)) (<= ~N~0 (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))))), 199326#(and (or (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 (+ ~q1_front~0 1)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) (<= ~n2~0 (+ ~q2_back~0 1)) (<= ~q1_back~0 (+ ~q1_front~0 1)) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (< ~q2_back~0 0)) (or (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 (+ ~q1_front~0 1)) (<= 1 ~N~0) (<= ~n2~0 (+ ~q2_back~0 1)) (<= ~q1_back~0 (+ ~q1_front~0 1)) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (< ~q2_back~0 0)) (or (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 (+ ~q1_front~0 1)) (<= ~n2~0 (+ ~q2_back~0 1)) (<= ~q1_back~0 (+ ~q1_front~0 1)) (<= ~N~0 1) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (< ~q2_back~0 0)) (or (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 (+ ~q1_front~0 1)) (<= ~q2_front~0 1) (<= ~n2~0 (+ ~q2_back~0 1)) (<= ~q1_back~0 (+ ~q1_front~0 1)) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (< ~q2_back~0 0)) (or (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 (+ ~q1_front~0 1)) (<= ~n2~0 (+ ~q2_back~0 1)) (<= ~q1_back~0 (+ ~q1_front~0 1)) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (< ~q2_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1))) (or (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 (+ ~q1_front~0 1)) (= ~t~0 0) (<= ~n2~0 (+ ~q2_back~0 1)) (<= ~q1_back~0 (+ ~q1_front~0 1)) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (< ~q2_back~0 0)) (or (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4) 4)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)))) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 (+ ~q1_front~0 1)) (<= ~n2~0 (+ ~q2_back~0 1)) (<= ~q1_back~0 (+ ~q1_front~0 1)) (= ~q2~0.offset 0) (not (= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4) 4)) 0)) (< ~q2_back~0 0)))] [2022-03-15 19:55:23,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 19:55:23,133 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:55:23,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 19:55:23,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1753, Unknown=5, NotChecked=174, Total=2162 [2022-03-15 19:55:23,134 INFO L87 Difference]: Start difference. First operand 1534 states and 4988 transitions. Second operand has 25 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:55:27,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:55:27,657 INFO L93 Difference]: Finished difference Result 2121 states and 6684 transitions. [2022-03-15 19:55:27,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 19:55:27,658 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:55:27,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:55:27,661 INFO L225 Difference]: With dead ends: 2121 [2022-03-15 19:55:27,662 INFO L226 Difference]: Without dead ends: 2095 [2022-03-15 19:55:27,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 81 SyntacticMatches, 9 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=343, Invalid=2739, Unknown=6, NotChecked=218, Total=3306 [2022-03-15 19:55:27,662 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 122 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 1755 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 1803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:55:27,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 204 Invalid, 1803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1755 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 19:55:27,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2095 states. [2022-03-15 19:55:27,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2095 to 1589. [2022-03-15 19:55:27,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1588 states have (on average 3.2399244332493704) internal successors, (5145), 1588 states have internal predecessors, (5145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:55:27,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 5145 transitions. [2022-03-15 19:55:27,682 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 5145 transitions. Word has length 31 [2022-03-15 19:55:27,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:55:27,682 INFO L470 AbstractCegarLoop]: Abstraction has 1589 states and 5145 transitions. [2022-03-15 19:55:27,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:55:27,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 5145 transitions. [2022-03-15 19:55:27,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:55:27,685 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:55:27,685 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2022-03-15 19:55:27,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-03-15 19:55:27,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-03-15 19:55:27,885 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:55:27,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:55:27,886 INFO L85 PathProgramCache]: Analyzing trace with hash 388126680, now seen corresponding path program 27 times [2022-03-15 19:55:27,886 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:55:27,887 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755164291] [2022-03-15 19:55:27,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:55:27,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:55:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:55:29,518 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:55:29,518 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:55:29,518 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755164291] [2022-03-15 19:55:29,518 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755164291] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:55:29,518 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659995171] [2022-03-15 19:55:29,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:55:29,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:55:29,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:55:29,519 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:55:29,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-03-15 19:55:29,754 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:55:29,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:55:29,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 61 conjunts are in the unsatisfiable core [2022-03-15 19:55:29,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:55:30,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:55:30,219 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:55:30,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:55:30,319 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 Received shutdown request... [2022-03-15 19:55:30,436 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-03-15 19:55:30,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-03-15 19:55:30,456 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:55:30,471 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:55:30,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-03-15 19:55:30,637 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-3-1 context. [2022-03-15 19:55:30,638 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 19:55:30,639 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 19:55:30,639 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 19:55:30,640 INFO L732 BasicCegarLoop]: Path program histogram: [27, 13, 8, 2, 1, 1, 1, 1, 1] [2022-03-15 19:55:30,642 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 19:55:30,642 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 19:55:30,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 07:55:30 BasicIcfg [2022-03-15 19:55:30,643 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 19:55:30,643 INFO L158 Benchmark]: Toolchain (without parser) took 723600.77ms. Allocated memory was 182.5MB in the beginning and 859.8MB in the end (delta: 677.4MB). Free memory was 127.2MB in the beginning and 328.1MB in the end (delta: -200.9MB). Peak memory consumption was 478.0MB. Max. memory is 8.0GB. [2022-03-15 19:55:30,643 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 19:55:30,643 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.76ms. Allocated memory was 182.5MB in the beginning and 239.1MB in the end (delta: 56.6MB). Free memory was 127.0MB in the beginning and 210.5MB in the end (delta: -83.5MB). Peak memory consumption was 7.8MB. Max. memory is 8.0GB. [2022-03-15 19:55:30,644 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.21ms. Allocated memory is still 239.1MB. Free memory was 210.5MB in the beginning and 208.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:55:30,644 INFO L158 Benchmark]: Boogie Preprocessor took 26.43ms. Allocated memory is still 239.1MB. Free memory was 208.4MB in the beginning and 206.3MB in the end (delta: 2.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 19:55:30,644 INFO L158 Benchmark]: RCFGBuilder took 580.48ms. Allocated memory is still 239.1MB. Free memory was 206.3MB in the beginning and 178.0MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-03-15 19:55:30,644 INFO L158 Benchmark]: TraceAbstraction took 722709.57ms. Allocated memory was 239.1MB in the beginning and 859.8MB in the end (delta: 620.8MB). Free memory was 177.4MB in the beginning and 328.1MB in the end (delta: -150.6MB). Peak memory consumption was 471.1MB. Max. memory is 8.0GB. [2022-03-15 19:55:30,644 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 237.76ms. Allocated memory was 182.5MB in the beginning and 239.1MB in the end (delta: 56.6MB). Free memory was 127.0MB in the beginning and 210.5MB in the end (delta: -83.5MB). Peak memory consumption was 7.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.21ms. Allocated memory is still 239.1MB. Free memory was 210.5MB in the beginning and 208.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.43ms. Allocated memory is still 239.1MB. Free memory was 208.4MB in the beginning and 206.3MB in the end (delta: 2.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 580.48ms. Allocated memory is still 239.1MB. Free memory was 206.3MB in the beginning and 178.0MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * TraceAbstraction took 722709.57ms. Allocated memory was 239.1MB in the beginning and 859.8MB in the end (delta: 620.8MB). Free memory was 177.4MB in the beginning and 328.1MB in the end (delta: -150.6MB). Peak memory consumption was 471.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.1s, 203 PlacesBefore, 36 PlacesAfterwards, 211 TransitionsBefore, 32 TransitionsAfterwards, 1456 CoEnabledTransitionPairs, 8 FixpointIterations, 148 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 19 TrivialYvCompositions, 10 ConcurrentYvCompositions, 12 ChoiceCompositions, 218 TotalNumberOfCompositions, 2319 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1650, positive: 1572, positive conditional: 0, positive unconditional: 1572, negative: 78, negative conditional: 0, negative unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 803, positive: 785, positive conditional: 0, positive unconditional: 785, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1650, positive: 787, positive conditional: 0, positive unconditional: 787, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 803, unknown conditional: 0, unknown unconditional: 803] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 126]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-3-1 context. - TimeoutResultAtElement [Line: 120]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-3-1 context. - TimeoutResultAtElement [Line: 119]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-3-1 context. - TimeoutResultAtElement [Line: 118]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-3-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 224 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 722.6s, OverallIterations: 55, TraceHistogramMax: 7, PathProgramHistogramMax: 27, EmptinessCheckTime: 0.1s, AutomataDifference: 116.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5482 SdHoareTripleChecker+Valid, 36.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5482 mSDsluCounter, 6834 SdHoareTripleChecker+Invalid, 31.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 156 IncrementalHoareTripleChecker+Unchecked, 20671 mSDsCounter, 2184 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 53288 IncrementalHoareTripleChecker+Invalid, 55628 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2184 mSolverCounterUnsat, 609 mSDtfsCounter, 53288 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5377 GetRequests, 2956 SyntacticMatches, 167 SemanticMatches, 2254 ConstructedPredicates, 53 IntricatePredicates, 2 DeprecatedPredicates, 24649 ImplicationChecksByTransitivity, 160.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1691occurred in iteration=50, InterpolantAutomatonStates: 985, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 54 MinimizatonAttempts, 21462 StatesRemovedByMinimization, 51 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 4.7s SatisfiabilityAnalysisTime, 357.6s InterpolantComputationTime, 3001 NumberOfCodeBlocks, 2995 NumberOfCodeBlocksAsserted, 150 NumberOfCheckSat, 4214 ConstructedInterpolants, 614 QuantifiedInterpolants, 146810 SizeOfPredicates, 1043 NumberOfNonLiveVariables, 17299 ConjunctsInSsa, 2294 ConjunctsInUnsatCore, 149 InterpolantComputations, 9 PerfectInterpolantSequences, 548/1624 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown