/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-horseshoe.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 19:18:00,573 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 19:18:00,575 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 19:18:00,609 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 19:18:00,609 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 19:18:00,610 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 19:18:00,611 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 19:18:00,613 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 19:18:00,615 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 19:18:00,622 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 19:18:00,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 19:18:00,624 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 19:18:00,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 19:18:00,625 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 19:18:00,626 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 19:18:00,627 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 19:18:00,627 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 19:18:00,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 19:18:00,633 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 19:18:00,638 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 19:18:00,645 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 19:18:00,646 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 19:18:00,647 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 19:18:00,648 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 19:18:00,650 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 19:18:00,650 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 19:18:00,650 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 19:18:00,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 19:18:00,651 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 19:18:00,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 19:18:00,652 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 19:18:00,657 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 19:18:00,659 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 19:18:00,659 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 19:18:00,660 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 19:18:00,660 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 19:18:00,661 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 19:18:00,661 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 19:18:00,661 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 19:18:00,662 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 19:18:00,662 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 19:18:00,663 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:18:00,690 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 19:18:00,690 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 19:18:00,692 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 19:18:00,692 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 19:18:00,692 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 19:18:00,692 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 19:18:00,692 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 19:18:00,692 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 19:18:00,693 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 19:18:00,693 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 19:18:00,693 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 19:18:00,694 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 19:18:00,694 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 19:18:00,694 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 19:18:00,694 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 19:18:00,694 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 19:18:00,694 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 19:18:00,694 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 19:18:00,694 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 19:18:00,694 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 19:18:00,695 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 19:18:00,695 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 19:18:00,695 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 19:18:00,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:18:00,695 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 19:18:00,695 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 19:18:00,695 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 19:18:00,696 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 19:18:00,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 19:18:00,696 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 19:18:00,696 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 19:18:00,696 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 19:18:00,696 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:18:00,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 19:18:00,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 19:18:00,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 19:18:00,926 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 19:18:00,932 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 19:18:00,933 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c [2022-03-15 19:18:00,985 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/136eeeafc/8abd91d4e748485d8ba9e2c7723abd55/FLAG9372f7044 [2022-03-15 19:18:01,350 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 19:18:01,350 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c [2022-03-15 19:18:01,357 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/136eeeafc/8abd91d4e748485d8ba9e2c7723abd55/FLAG9372f7044 [2022-03-15 19:18:01,368 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/136eeeafc/8abd91d4e748485d8ba9e2c7723abd55 [2022-03-15 19:18:01,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 19:18:01,371 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 19:18:01,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 19:18:01,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 19:18:01,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 19:18:01,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:18:01" (1/1) ... [2022-03-15 19:18:01,382 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38093c56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:18:01, skipping insertion in model container [2022-03-15 19:18:01,382 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:18:01" (1/1) ... [2022-03-15 19:18:01,388 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 19:18:01,410 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 19:18:01,589 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-horseshoe.wvr.c[3424,3437] [2022-03-15 19:18:01,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:18:01,601 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 19:18:01,622 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-horseshoe.wvr.c[3424,3437] [2022-03-15 19:18:01,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:18:01,635 INFO L208 MainTranslator]: Completed translation [2022-03-15 19:18:01,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:18:01 WrapperNode [2022-03-15 19:18:01,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 19:18:01,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 19:18:01,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 19:18:01,637 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 19:18:01,642 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:18:01" (1/1) ... [2022-03-15 19:18:01,649 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:18:01" (1/1) ... [2022-03-15 19:18:01,673 INFO L137 Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 245 [2022-03-15 19:18:01,674 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 19:18:01,674 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 19:18:01,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 19:18:01,675 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 19:18:01,684 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:18:01" (1/1) ... [2022-03-15 19:18:01,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:18:01" (1/1) ... [2022-03-15 19:18:01,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:18:01" (1/1) ... [2022-03-15 19:18:01,688 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:18:01" (1/1) ... [2022-03-15 19:18:01,705 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:18:01" (1/1) ... [2022-03-15 19:18:01,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:18:01" (1/1) ... [2022-03-15 19:18:01,711 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:18:01" (1/1) ... [2022-03-15 19:18:01,714 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 19:18:01,714 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 19:18:01,715 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 19:18:01,715 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 19:18:01,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:18:01" (1/1) ... [2022-03-15 19:18:01,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:18:01,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:18:01,764 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:18:01,788 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:18:01,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 19:18:01,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 19:18:01,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 19:18:01,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 19:18:01,804 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 19:18:01,804 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 19:18:01,804 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 19:18:01,804 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 19:18:01,804 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 19:18:01,805 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 19:18:01,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 19:18:01,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 19:18:01,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 19:18:01,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 19:18:01,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 19:18:01,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 19:18:01,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 19:18:01,806 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:18:01,915 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 19:18:01,917 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 19:18:02,273 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 19:18:02,439 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 19:18:02,440 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-03-15 19:18:02,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:18:02 BoogieIcfgContainer [2022-03-15 19:18:02,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 19:18:02,443 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 19:18:02,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 19:18:02,446 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 19:18:02,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 07:18:01" (1/3) ... [2022-03-15 19:18:02,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ac3fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:18:02, skipping insertion in model container [2022-03-15 19:18:02,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:18:01" (2/3) ... [2022-03-15 19:18:02,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ac3fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:18:02, skipping insertion in model container [2022-03-15 19:18:02,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:18:02" (3/3) ... [2022-03-15 19:18:02,449 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-horseshoe.wvr.c [2022-03-15 19:18:02,453 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 19:18:02,453 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 19:18:02,453 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 19:18:02,453 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 19:18:02,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,502 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:18:02,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,502 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:18:02,503 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:18:02,503 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,503 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,503 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:18:02,503 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:18:02,504 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,504 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:18:02,504 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,504 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:18:02,505 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,505 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:18:02,505 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,505 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,505 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,506 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,506 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,506 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,506 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,506 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,506 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,507 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,507 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,507 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,507 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,507 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,508 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,508 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,508 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,508 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,508 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,509 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,509 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,509 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,509 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,509 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:18:02,509 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,509 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:18:02,510 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,510 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,510 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:18:02,510 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,510 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:18:02,511 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,511 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:18:02,511 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,511 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,512 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:18:02,512 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,512 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:18:02,512 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,513 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,513 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:18:02,513 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,513 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,514 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,514 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,514 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,514 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,515 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,515 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,515 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,515 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,516 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,516 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,516 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:18:02,516 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,516 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,516 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,516 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:18:02,517 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:18:02,517 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,517 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,517 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,518 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:18:02,518 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,518 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,519 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,519 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,519 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,519 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,522 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,523 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,523 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:18:02,523 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:18:02,523 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,523 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,523 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,524 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,524 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,524 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,525 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:18:02,525 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,525 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,525 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,525 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,525 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,526 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:18:02,526 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,526 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:18:02,526 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,527 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,527 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,527 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:18:02,527 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,527 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,527 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:18:02,531 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 19:18:02,567 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 19:18:02,572 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:18:02,573 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 19:18:02,590 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 19:18:02,600 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 211 transitions, 446 flow [2022-03-15 19:18:02,606 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 203 places, 211 transitions, 446 flow [2022-03-15 19:18:02,608 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 203 places, 211 transitions, 446 flow [2022-03-15 19:18:02,727 INFO L129 PetriNetUnfolder]: 18/208 cut-off events. [2022-03-15 19:18:02,727 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 19:18:02,733 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 113 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:18:02,737 INFO L116 LiptonReduction]: Number of co-enabled transitions 1456 [2022-03-15 19:18:09,333 INFO L131 LiptonReduction]: Checked pairs total: 2278 [2022-03-15 19:18:09,333 INFO L133 LiptonReduction]: Total number of compositions: 215 [2022-03-15 19:18:09,339 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 32 transitions, 88 flow [2022-03-15 19:18:09,366 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:18:09,370 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:18:09,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:18:09,378 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:18:09,379 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:18:09,379 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:18:09,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:18:09,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1400872871, now seen corresponding path program 1 times [2022-03-15 19:18:09,399 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:18:09,399 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539724737] [2022-03-15 19:18:09,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:18:09,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:18:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:09,580 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:18:09,581 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:18:09,581 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539724737] [2022-03-15 19:18:09,582 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539724737] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:18:09,582 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:18:09,582 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 19:18:09,583 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2011787138] [2022-03-15 19:18:09,584 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:18:09,592 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:18:09,622 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 105 transitions. [2022-03-15 19:18:09,623 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:18:09,865 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:18:09,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-15 19:18:09,867 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:18:09,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-15 19:18:09,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-15 19:18:09,890 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:18:09,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:18:09,936 INFO L93 Difference]: Finished difference Result 138 states and 428 transitions. [2022-03-15 19:18:09,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-15 19:18:09,938 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:18:09,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:18:09,948 INFO L225 Difference]: With dead ends: 138 [2022-03-15 19:18:09,948 INFO L226 Difference]: Without dead ends: 138 [2022-03-15 19:18:09,949 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:18:09,952 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:18:09,954 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:18:09,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-03-15 19:18:10,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-03-15 19:18:10,003 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:18:10,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 428 transitions. [2022-03-15 19:18:10,008 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 428 transitions. Word has length 21 [2022-03-15 19:18:10,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:18:10,009 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 428 transitions. [2022-03-15 19:18:10,009 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:18:10,009 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 428 transitions. [2022-03-15 19:18:10,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:18:10,015 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:18:10,015 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:18:10,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 19:18:10,016 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:18:10,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:18:10,018 INFO L85 PathProgramCache]: Analyzing trace with hash 823728615, now seen corresponding path program 1 times [2022-03-15 19:18:10,019 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:18:10,020 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444046338] [2022-03-15 19:18:10,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:18:10,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:18:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:10,125 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:18:10,125 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:18:10,126 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444046338] [2022-03-15 19:18:10,126 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444046338] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:18:10,126 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:18:10,126 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:18:10,126 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1326430032] [2022-03-15 19:18:10,126 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:18:10,130 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:18:10,144 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 101 transitions. [2022-03-15 19:18:10,145 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:18:10,555 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:18:10,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:18:10,557 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:18:10,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:18:10,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:18:10,558 INFO L87 Difference]: Start difference. First operand 138 states and 428 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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:18:10,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:18:10,654 INFO L93 Difference]: Finished difference Result 215 states and 600 transitions. [2022-03-15 19:18:10,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:18:10,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:18:10,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:18:10,658 INFO L225 Difference]: With dead ends: 215 [2022-03-15 19:18:10,658 INFO L226 Difference]: Without dead ends: 139 [2022-03-15 19:18:10,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 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:18:10,666 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 25 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:18:10,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 12 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:18:10,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-03-15 19:18:10,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-03-15 19:18:10,680 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:18:10,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 429 transitions. [2022-03-15 19:18:10,681 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 429 transitions. Word has length 22 [2022-03-15 19:18:10,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:18:10,681 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 429 transitions. [2022-03-15 19:18:10,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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:18:10,682 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 429 transitions. [2022-03-15 19:18:10,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:18:10,683 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:18:10,683 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:18:10,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 19:18:10,683 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:18:10,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:18:10,684 INFO L85 PathProgramCache]: Analyzing trace with hash 211043187, now seen corresponding path program 1 times [2022-03-15 19:18:10,686 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:18:10,687 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337055790] [2022-03-15 19:18:10,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:18:10,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:18:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:10,833 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:18:10,834 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:18:10,834 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337055790] [2022-03-15 19:18:10,834 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337055790] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:18:10,834 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:18:10,834 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 19:18:10,834 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1107428700] [2022-03-15 19:18:10,835 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:18:10,839 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:18:10,857 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 102 transitions. [2022-03-15 19:18:10,857 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:18:10,893 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 13 treesize of output 5 [2022-03-15 19:18:10,964 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:18:11,076 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2022-03-15 19:18:11,254 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:18:11,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:18:11,255 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:18:11,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:18:11,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:18:11,255 INFO L87 Difference]: Start difference. First operand 139 states and 429 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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:18:11,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:18:11,323 INFO L93 Difference]: Finished difference Result 213 states and 614 transitions. [2022-03-15 19:18:11,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:18:11,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:18:11,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:18:11,324 INFO L225 Difference]: With dead ends: 213 [2022-03-15 19:18:11,324 INFO L226 Difference]: Without dead ends: 140 [2022-03-15 19:18:11,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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:18:11,326 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 17 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:18:11,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 9 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:18:11,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-03-15 19:18:11,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-03-15 19:18:11,331 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:18:11,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 430 transitions. [2022-03-15 19:18:11,332 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 430 transitions. Word has length 23 [2022-03-15 19:18:11,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:18:11,332 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 430 transitions. [2022-03-15 19:18:11,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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:18:11,332 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 430 transitions. [2022-03-15 19:18:11,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:18:11,333 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:18:11,333 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:18:11,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 19:18:11,334 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:18:11,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:18:11,334 INFO L85 PathProgramCache]: Analyzing trace with hash 64715619, now seen corresponding path program 1 times [2022-03-15 19:18:11,335 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:18:11,335 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529013431] [2022-03-15 19:18:11,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:18:11,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:18:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:12,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:12,379 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:18:12,379 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529013431] [2022-03-15 19:18:12,380 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529013431] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:18:12,380 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212128469] [2022-03-15 19:18:12,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:18:12,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:18:12,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:18:12,382 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:18:12,392 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:18:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:12,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 61 conjunts are in the unsatisfiable core [2022-03-15 19:18:12,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:18:13,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:18:13,059 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:18:13,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:18:13,167 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:18:13,632 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:18:13,636 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 19:18:13,636 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 39 treesize of output 19 [2022-03-15 19:18:13,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:13,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:18:14,273 INFO L353 Elim1Store]: treesize reduction 12, result has 89.0 percent of original size [2022-03-15 19:18:14,274 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 1568 treesize of output 1464 [2022-03-15 19:18:14,328 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:18:14,329 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 1364 treesize of output 1268 [2022-03-15 19:18:14,369 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:18:14,370 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 1220 treesize of output 980 [2022-03-15 19:18:32,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:32,967 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212128469] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:18:32,967 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:18:32,967 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 31 [2022-03-15 19:18:32,967 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [565172102] [2022-03-15 19:18:32,967 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:18:32,973 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:18:32,991 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 103 transitions. [2022-03-15 19:18:32,992 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:18:40,492 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [2069#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= (+ ~s~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (+ 2 (* 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (<= ~n1~0 ~q1_front~0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n2~0 ~q2_back~0) (not (= (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n2~0 ~q2_back~0) (not (= (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q2_front~0 0) (< ~q2_back~0 0)) (or (<= (+ 2 (* 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (+ ~s~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n2~0 ~q2_back~0) (not (= (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (not (= (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< ~q2_back~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n2~0 ~q2_back~0) (not (= (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (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))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n2~0 ~q2_back~0) (not (= (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= ~q2~0.offset 0) (< ~q2_back~0 0))), 2068#(and (or (< 0 |thread2Thread1of1ForFork2_~j~0#1|) (<= ~n2~0 ~q2_back~0) (<= (+ |thread2Thread1of1ForFork2_~j~0#1| ~s~0) (+ 2 (* 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (not (= |thread2Thread1of1ForFork2_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< ~q2_back~0 0)) (or (< 0 |thread2Thread1of1ForFork2_~j~0#1|) (<= (+ 2 (* 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (+ |thread2Thread1of1ForFork2_~j~0#1| ~s~0)) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< ~q2_back~0 0)) (or (< 0 |thread2Thread1of1ForFork2_~j~0#1|) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (<= ~q2_front~0 0) (< ~q2_back~0 0)) (or (< 0 |thread2Thread1of1ForFork2_~j~0#1|) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (= ~q2~0.offset 0) (< ~q2_back~0 0)) (or (< 0 |thread2Thread1of1ForFork2_~j~0#1|) (<= ~n2~0 ~q2_back~0) (= ~t~0 0) (not (= |thread2Thread1of1ForFork2_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< ~q2_back~0 0)) (or (< 0 |thread2Thread1of1ForFork2_~j~0#1|) (<= ~n2~0 ~q2_back~0) (not (= |thread2Thread1of1ForFork2_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< ~q2_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)))), 2067#(and (or (<= ~n2~0 ~q2_front~0) (<= ~s~0 (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (< ~q2_front~0 0) (not (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (not (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~q2_back~0 ~q2_front~0) (< (+ (* 2 ~t~0) (* 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) 1) ~s~0)))] [2022-03-15 19:18:40,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:18:40,493 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:18:40,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:18:40,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1089, Unknown=9, NotChecked=0, Total=1260 [2022-03-15 19:18:40,494 INFO L87 Difference]: Start difference. First operand 140 states and 430 transitions. Second operand has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 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:18:42,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:18:42,382 INFO L93 Difference]: Finished difference Result 466 states and 1385 transitions. [2022-03-15 19:18:42,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 19:18:42,382 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 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 24 [2022-03-15 19:18:42,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:18:42,385 INFO L225 Difference]: With dead ends: 466 [2022-03-15 19:18:42,386 INFO L226 Difference]: Without dead ends: 457 [2022-03-15 19:18:42,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=251, Invalid=1902, Unknown=9, NotChecked=0, Total=2162 [2022-03-15 19:18:42,387 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 85 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:18:42,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 133 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:18:42,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2022-03-15 19:18:42,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 254. [2022-03-15 19:18:42,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 3.1383399209486167) internal successors, (794), 253 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:18:42,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 794 transitions. [2022-03-15 19:18:42,408 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 794 transitions. Word has length 24 [2022-03-15 19:18:42,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:18:42,409 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 794 transitions. [2022-03-15 19:18:42,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 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:18:42,409 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 794 transitions. [2022-03-15 19:18:42,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:18:42,410 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:18:42,410 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:18:42,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 19:18:42,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:18:42,624 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:18:42,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:18:42,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1596943851, now seen corresponding path program 2 times [2022-03-15 19:18:42,625 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:18:42,625 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370949553] [2022-03-15 19:18:42,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:18:42,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:18:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:42,697 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:18:42,697 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:18:42,697 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370949553] [2022-03-15 19:18:42,697 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370949553] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:18:42,697 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:18:42,697 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:18:42,697 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1505074015] [2022-03-15 19:18:42,698 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:18:42,703 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:18:42,716 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 104 transitions. [2022-03-15 19:18:42,717 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:18:42,789 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:18:43,077 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:18:43,420 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:18:43,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:18:43,421 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:18:43,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:18:43,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:18:43,422 INFO L87 Difference]: Start difference. First operand 254 states and 794 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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:18:43,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:18:43,482 INFO L93 Difference]: Finished difference Result 282 states and 835 transitions. [2022-03-15 19:18:43,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:18:43,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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 24 [2022-03-15 19:18:43,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:18:43,485 INFO L225 Difference]: With dead ends: 282 [2022-03-15 19:18:43,485 INFO L226 Difference]: Without dead ends: 282 [2022-03-15 19:18:43,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 12 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:18:43,487 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 19 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:18:43,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 5 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:18:43,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-03-15 19:18:43,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2022-03-15 19:18:43,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 2.9715302491103204) internal successors, (835), 281 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:18:43,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 835 transitions. [2022-03-15 19:18:43,501 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 835 transitions. Word has length 24 [2022-03-15 19:18:43,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:18:43,502 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 835 transitions. [2022-03-15 19:18:43,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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:18:43,502 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 835 transitions. [2022-03-15 19:18:43,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:18:43,503 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:18:43,503 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:18:43,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 19:18:43,503 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:18:43,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:18:43,504 INFO L85 PathProgramCache]: Analyzing trace with hash 244979427, now seen corresponding path program 3 times [2022-03-15 19:18:43,505 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:18:43,505 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549404230] [2022-03-15 19:18:43,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:18:43,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:18:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:44,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:44,406 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:18:44,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549404230] [2022-03-15 19:18:44,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549404230] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:18:44,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246669746] [2022-03-15 19:18:44,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:18:44,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:18:44,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:18:44,408 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:18:44,409 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:18:44,532 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-15 19:18:44,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:18:44,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 40 conjunts are in the unsatisfiable core [2022-03-15 19:18:44,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:18:44,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:18:44,806 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:18:45,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:18:45,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:18:45,012 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-15 19:18:45,012 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 42 treesize of output 45 [2022-03-15 19:18:45,154 INFO L353 Elim1Store]: treesize reduction 3, result has 85.0 percent of original size [2022-03-15 19:18:45,154 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 32 [2022-03-15 19:18:45,190 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:18:45,191 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 19:18:45,191 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246669746] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:18:45,191 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 19:18:45,191 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 20 [2022-03-15 19:18:45,191 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2091929587] [2022-03-15 19:18:45,191 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:18:45,196 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:18:45,204 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 44 transitions. [2022-03-15 19:18:45,204 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:18:45,503 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [4007#(and (or (< ~q2_front~0 0) (not (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~q2_back~0 ~q2_front~0) (= ~s~0 0)) (or (< 0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~s~0)))] [2022-03-15 19:18:45,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:18:45,503 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:18:45,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:18:45,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-03-15 19:18:45,504 INFO L87 Difference]: Start difference. First operand 282 states and 835 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 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:18:45,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:18:45,665 INFO L93 Difference]: Finished difference Result 358 states and 966 transitions. [2022-03-15 19:18:45,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 19:18:45,665 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 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:18:45,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:18:45,667 INFO L225 Difference]: With dead ends: 358 [2022-03-15 19:18:45,667 INFO L226 Difference]: Without dead ends: 351 [2022-03-15 19:18:45,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2022-03-15 19:18:45,668 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 43 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:18:45,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 63 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 160 Invalid, 0 Unknown, 132 Unchecked, 0.1s Time] [2022-03-15 19:18:45,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-03-15 19:18:45,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 297. [2022-03-15 19:18:45,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 2.858108108108108) internal successors, (846), 296 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:18:45,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 846 transitions. [2022-03-15 19:18:45,678 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 846 transitions. Word has length 24 [2022-03-15 19:18:45,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:18:45,678 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 846 transitions. [2022-03-15 19:18:45,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 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:18:45,679 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 846 transitions. [2022-03-15 19:18:45,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:18:45,680 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:18:45,680 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] [2022-03-15 19:18:45,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-15 19:18:45,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-03-15 19:18:45,901 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:18:45,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:18:45,902 INFO L85 PathProgramCache]: Analyzing trace with hash 996015785, now seen corresponding path program 4 times [2022-03-15 19:18:45,903 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:18:45,903 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282350685] [2022-03-15 19:18:45,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:18:45,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:18:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:18:46,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:18:46,840 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:18:46,840 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282350685] [2022-03-15 19:18:46,840 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282350685] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:18:46,840 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64685253] [2022-03-15 19:18:46,840 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:18:46,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:18:46,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:18:46,852 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:18:46,853 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:18:46,948 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:18:46,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:18:46,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 69 conjunts are in the unsatisfiable core [2022-03-15 19:18:46,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:18:47,195 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 19:18:47,279 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:18:47,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:18:47,474 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:18:47,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:18:47,550 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:18:47,899 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:18:47,914 INFO L353 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-03-15 19:18:47,914 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 43 treesize of output 33 [2022-03-15 19:18:47,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:18:47,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:18:49,184 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:18:49,184 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 232 treesize of output 160 [2022-03-15 19:18:49,263 INFO L353 Elim1Store]: treesize reduction 12, result has 89.0 percent of original size [2022-03-15 19:18:49,263 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 15684 treesize of output 14684 [2022-03-15 19:18:49,326 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:18:49,327 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 14564 treesize of output 11348 [2022-03-15 19:18:49,406 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:18:49,407 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 11324 treesize of output 10598 [2022-03-15 19:18:49,489 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:18:49,490 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 10484 treesize of output 8900 [2022-03-15 19:19:57,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:19:57,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64685253] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:19:57,803 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:19:57,803 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 31 [2022-03-15 19:19:57,804 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [923194784] [2022-03-15 19:19:57,804 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:19:57,807 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:19:57,821 INFO L252 McrAutomatonBuilder]: Finished intersection with 61 states and 104 transitions. [2022-03-15 19:19:57,822 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:02,750 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [5139#(and (or (<= ~n2~0 ~q2_front~0) (<= ~s~0 (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (< ~q2_front~0 0) (not (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (not (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~q2_back~0 ~q2_front~0) (< (+ (* 2 ~t~0) (* 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) 1) ~s~0))), 5140#(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 ~q2_front~0) (+ ~q2_back~0 1)) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= ~s~0 0)) (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)) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_front~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= ~t~0 0)))] [2022-03-15 19:20:02,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:20:02,751 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:02,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:20:02,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1043, Unknown=5, NotChecked=0, Total=1190 [2022-03-15 19:20:02,752 INFO L87 Difference]: Start difference. First operand 297 states and 846 transitions. Second operand has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 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:20:03,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:20:03,809 INFO L93 Difference]: Finished difference Result 536 states and 1421 transitions. [2022-03-15 19:20:03,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 19:20:03,810 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 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 25 [2022-03-15 19:20:03,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:20:03,813 INFO L225 Difference]: With dead ends: 536 [2022-03-15 19:20:03,813 INFO L226 Difference]: Without dead ends: 529 [2022-03-15 19:20:03,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=181, Invalid=1296, Unknown=5, NotChecked=0, Total=1482 [2022-03-15 19:20:03,814 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 38 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:20:03,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 111 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:20:03,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2022-03-15 19:20:03,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 329. [2022-03-15 19:20:03,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 2.847560975609756) internal successors, (934), 328 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:03,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 934 transitions. [2022-03-15 19:20:03,828 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 934 transitions. Word has length 25 [2022-03-15 19:20:03,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:20:03,829 INFO L470 AbstractCegarLoop]: Abstraction has 329 states and 934 transitions. [2022-03-15 19:20:03,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 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:20:03,829 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 934 transitions. [2022-03-15 19:20:03,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:20:03,832 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:03,832 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:20:03,859 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:20:04,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:04,056 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:20:04,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:04,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1364504266, now seen corresponding path program 1 times [2022-03-15 19:20:04,057 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:04,057 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351906820] [2022-03-15 19:20:04,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:04,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:04,114 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:20:04,115 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:04,115 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351906820] [2022-03-15 19:20:04,115 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351906820] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:20:04,115 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510413627] [2022-03-15 19:20:04,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:04,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:04,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:20:04,116 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:20:04,151 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:20:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:04,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:20:04,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:20:04,324 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:20:04,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:20:04,392 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:20:04,392 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510413627] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:20:04,392 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:20:04,392 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-03-15 19:20:04,393 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [294176375] [2022-03-15 19:20:04,393 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:20:04,397 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:20:04,413 INFO L252 McrAutomatonBuilder]: Finished intersection with 61 states and 104 transitions. [2022-03-15 19:20:04,413 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:04,793 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [6499#(or (<= ~n1~0 0) (<= ~q1_back~0 0))] [2022-03-15 19:20:04,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 19:20:04,794 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:04,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 19:20:04,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-03-15 19:20:04,795 INFO L87 Difference]: Start difference. First operand 329 states and 934 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:04,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:20:04,900 INFO L93 Difference]: Finished difference Result 533 states and 1380 transitions. [2022-03-15 19:20:04,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:20:04,901 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 19:20:04,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:20:04,903 INFO L225 Difference]: With dead ends: 533 [2022-03-15 19:20:04,903 INFO L226 Difference]: Without dead ends: 469 [2022-03-15 19:20:04,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 77 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:20:04,904 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 61 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:20:04,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 24 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:20:04,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-03-15 19:20:04,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 332. [2022-03-15 19:20:04,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 2.673716012084592) internal successors, (885), 331 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:04,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 885 transitions. [2022-03-15 19:20:04,918 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 885 transitions. Word has length 25 [2022-03-15 19:20:04,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:20:04,918 INFO L470 AbstractCegarLoop]: Abstraction has 332 states and 885 transitions. [2022-03-15 19:20:04,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:04,918 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 885 transitions. [2022-03-15 19:20:04,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:20:04,919 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:04,919 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:20:04,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-15 19:20:05,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:05,135 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:20:05,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:05,136 INFO L85 PathProgramCache]: Analyzing trace with hash 37938683, now seen corresponding path program 1 times [2022-03-15 19:20:05,137 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:05,137 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825227774] [2022-03-15 19:20:05,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:05,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:05,195 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:20:05,195 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:05,195 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825227774] [2022-03-15 19:20:05,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825227774] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:20:05,196 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:20:05,196 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:20:05,196 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [788836705] [2022-03-15 19:20:05,196 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:20:05,200 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:20:05,218 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 114 transitions. [2022-03-15 19:20:05,219 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:05,238 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:20:05,260 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:20:05,322 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:20:05,364 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 13 treesize of output 5 [2022-03-15 19:20:05,449 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:20:05,554 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 19:20:05,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 13 treesize of output 5 [2022-03-15 19:20:05,939 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [7706#(or (< ~q2_front~0 0) (<= ~q2_back~0 (+ 1 ~q2_front~0))), 7707#(or (<= ~q2_back~0 ~q2_front~0) (< ~q2_back~0 0)), 7705#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))] [2022-03-15 19:20:05,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 19:20:05,939 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:05,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 19:20:05,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-03-15 19:20:05,940 INFO L87 Difference]: Start difference. First operand 332 states and 885 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:06,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:20:06,010 INFO L93 Difference]: Finished difference Result 448 states and 1205 transitions. [2022-03-15 19:20:06,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:20:06,011 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 19:20:06,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:20:06,013 INFO L225 Difference]: With dead ends: 448 [2022-03-15 19:20:06,013 INFO L226 Difference]: Without dead ends: 365 [2022-03-15 19:20:06,013 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-03-15 19:20:06,014 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 74 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:20:06,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 6 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:20:06,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-03-15 19:20:06,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 309. [2022-03-15 19:20:06,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 2.840909090909091) internal successors, (875), 308 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:06,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 875 transitions. [2022-03-15 19:20:06,026 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 875 transitions. Word has length 25 [2022-03-15 19:20:06,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:20:06,027 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 875 transitions. [2022-03-15 19:20:06,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:20:06,027 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 875 transitions. [2022-03-15 19:20:06,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:20:06,028 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:06,028 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] [2022-03-15 19:20:06,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 19:20:06,029 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:20:06,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:06,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1135005229, now seen corresponding path program 5 times [2022-03-15 19:20:06,030 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:06,030 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623087563] [2022-03-15 19:20:06,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:06,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:06,959 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:06,959 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:06,959 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623087563] [2022-03-15 19:20:06,959 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623087563] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:20:06,959 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255836223] [2022-03-15 19:20:06,959 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:20:06,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:06,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:20:06,960 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:20:06,961 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:20:07,061 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:20:07,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:20:07,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 19:20:07,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:20:07,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:20:07,401 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:20:07,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:20:07,469 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:20:07,752 INFO L353 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2022-03-15 19:20:07,753 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 43 treesize of output 30 [2022-03-15 19:20:07,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:20:07,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:20:08,141 WARN L838 $PredicateComparison]: unable to prove that (forall ((~q2~0.base Int) (~q2~0.offset Int) (v_ArrVal_399 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_399))) (let ((.cse5 (select .cse0 ~q2~0.base))) (let ((.cse6 (select .cse5 (+ ~q2~0.offset (* c_~q2_back~0 4))))) (let ((.cse1 (+ .cse6 1))) (or (not (<= (select (select .cse0 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse1)) (not (<= .cse1 0)) (let ((.cse4 (+ c_~s~0 .cse6)) (.cse2 (* c_~t~0 2)) (.cse3 (* 2 (select .cse5 (+ ~q2~0.offset (* c_~q2_front~0 4)))))) (and (< (+ .cse2 .cse3) .cse4) (<= .cse4 (+ .cse2 .cse3 1)))))))))) is different from false [2022-03-15 19:20:08,207 WARN L838 $PredicateComparison]: unable to prove that (forall ((~q2~0.base Int) (~q2~0.offset Int) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_398 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_398) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_399))) (let ((.cse5 (select .cse1 ~q2~0.base))) (let ((.cse6 (select .cse5 (+ ~q2~0.offset (* c_~q2_back~0 4))))) (let ((.cse0 (+ .cse6 1))) (or (not (<= .cse0 0)) (not (<= (select (select .cse1 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse0)) (let ((.cse4 (+ c_~s~0 .cse6)) (.cse2 (* c_~t~0 2)) (.cse3 (* 2 (select .cse5 (+ ~q2~0.offset (* c_~q2_front~0 4)))))) (and (< (+ .cse2 .cse3) .cse4) (<= .cse4 (+ .cse2 .cse3 1)))))))))) is different from false [2022-03-15 19:20:08,256 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:20:08,256 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 804 treesize of output 800 [2022-03-15 19:20:08,282 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:20:08,282 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 688 treesize of output 580 [2022-03-15 19:20:08,308 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:20:08,308 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 532 treesize of output 502 [2022-03-15 19:21:22,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:21:22,259 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255836223] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:21:22,259 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:21:22,259 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 29 [2022-03-15 19:21:22,259 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [66539234] [2022-03-15 19:21:22,259 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:22,262 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:22,273 INFO L252 McrAutomatonBuilder]: Finished intersection with 61 states and 104 transitions. [2022-03-15 19:21:22,273 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:21:25,875 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [8949#(and (or (<= ~n2~0 ~q2_front~0) (<= ~s~0 (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))))) (< ~q2_front~0 0) (not (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (not (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~q2_back~0 ~q2_front~0) (< (+ (* 2 ~t~0) (* 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) 1) ~s~0))), 8950#(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) (= ~s~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_front~0)) (or (<= ~q1_back~0 ~q1_front~0) (= (+ (* 4 ~q2_front~0) ~q2~0.offset) (+ ~q2~0.offset (* ~q2_back~0 4))) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~q2_front~0 0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~q2_back~0 ~q2_front~0) (not (<= ~q2_front~0 0))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (= ~t~0 0)))] [2022-03-15 19:21:25,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:21:25,875 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:21:25,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:21:25,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=824, Unknown=2, NotChecked=118, Total=1056 [2022-03-15 19:21:25,876 INFO L87 Difference]: Start difference. First operand 309 states and 875 transitions. Second operand has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 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:21:26,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:26,390 INFO L93 Difference]: Finished difference Result 401 states and 1055 transitions. [2022-03-15 19:21:26,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:21:26,390 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 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 25 [2022-03-15 19:21:26,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:26,392 INFO L225 Difference]: With dead ends: 401 [2022-03-15 19:21:26,392 INFO L226 Difference]: Without dead ends: 311 [2022-03-15 19:21:26,393 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=125, Invalid=937, Unknown=2, NotChecked=126, Total=1190 [2022-03-15 19:21:26,393 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 39 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:26,394 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 65 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:21:26,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-03-15 19:21:26,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 310. [2022-03-15 19:21:26,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 2.8349514563106797) internal successors, (876), 309 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:21:26,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 876 transitions. [2022-03-15 19:21:26,402 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 876 transitions. Word has length 25 [2022-03-15 19:21:26,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:26,403 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 876 transitions. [2022-03-15 19:21:26,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 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:21:26,403 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 876 transitions. [2022-03-15 19:21:26,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:21:26,404 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:26,405 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] [2022-03-15 19:21:26,434 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:21:26,619 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:21:26,620 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:21:26,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:26,620 INFO L85 PathProgramCache]: Analyzing trace with hash 2095438237, now seen corresponding path program 6 times [2022-03-15 19:21:26,621 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:26,621 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142758891] [2022-03-15 19:21:26,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:26,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:27,537 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:27,538 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:27,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142758891] [2022-03-15 19:21:27,538 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142758891] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:27,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5025950] [2022-03-15 19:21:27,538 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:21:27,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:27,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:27,540 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:21:27,544 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:21:27,662 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-15 19:21:27,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:21:27,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 19:21:27,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:21:27,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:21:27,881 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:21:27,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:21:27,928 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:21:28,116 INFO L353 Elim1Store]: treesize reduction 3, result has 85.0 percent of original size [2022-03-15 19:21:28,116 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 55 treesize of output 32 [2022-03-15 19:21:28,145 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 19:21:28,145 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 19:21:28,145 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5025950] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:21:28,145 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 19:21:28,145 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 20 [2022-03-15 19:21:28,145 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [329390426] [2022-03-15 19:21:28,145 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:28,149 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:28,161 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 105 transitions. [2022-03-15 19:21:28,161 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:21:29,005 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [10073#(and (or (= (- 1) (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (< ~q2_front~0 0) (not (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~q2_back~0 ~q2_front~0)) (or (< 0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= ~s~0 0)))] [2022-03-15 19:21:29,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:21:29,007 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:21:29,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:21:29,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2022-03-15 19:21:29,008 INFO L87 Difference]: Start difference. First operand 310 states and 876 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 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:21:29,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:29,205 INFO L93 Difference]: Finished difference Result 387 states and 1088 transitions. [2022-03-15 19:21:29,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 19:21:29,206 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 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 26 [2022-03-15 19:21:29,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:29,208 INFO L225 Difference]: With dead ends: 387 [2022-03-15 19:21:29,208 INFO L226 Difference]: Without dead ends: 368 [2022-03-15 19:21:29,208 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2022-03-15 19:21:29,209 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 37 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 185 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:29,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 51 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 213 Invalid, 0 Unknown, 185 Unchecked, 0.2s Time] [2022-03-15 19:21:29,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-03-15 19:21:29,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 310. [2022-03-15 19:21:29,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 2.8349514563106797) internal successors, (876), 309 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:21:29,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 876 transitions. [2022-03-15 19:21:29,217 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 876 transitions. Word has length 26 [2022-03-15 19:21:29,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:29,217 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 876 transitions. [2022-03-15 19:21:29,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 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:21:29,217 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 876 transitions. [2022-03-15 19:21:29,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:21:29,218 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:29,218 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] [2022-03-15 19:21:29,243 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:21:29,435 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:21:29,435 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:21:29,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:29,436 INFO L85 PathProgramCache]: Analyzing trace with hash -76010675, now seen corresponding path program 7 times [2022-03-15 19:21:29,437 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:29,437 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014086038] [2022-03-15 19:21:29,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:29,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:30,177 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:30,178 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:30,178 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014086038] [2022-03-15 19:21:30,178 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014086038] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:30,178 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777240605] [2022-03-15 19:21:30,178 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:21:30,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:30,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:30,180 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:21:30,187 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:21:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:30,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 19:21:30,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:21:30,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:21:30,511 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:21:30,556 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:21:30,682 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2022-03-15 19:21:30,716 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:21:30,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:21:30,767 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:21:30,767 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 35 treesize of output 35 [2022-03-15 19:21:30,947 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_522 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_522) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))))) (and (or .cse0 (forall ((~q2~0.offset Int)) (= (+ ~q2~0.offset (* c_~q2_back~0 4)) (+ ~q2~0.offset (* c_~q2_front~0 4))))) (or (<= (* c_~t~0 2) c_~s~0) .cse0) (forall ((v_ArrVal_522 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_522) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))) (or (< 0 .cse1) (<= c_~s~0 (+ (* c_~t~0 2) .cse1))))))) is different from false [2022-03-15 19:21:30,968 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:21:30,970 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 157 treesize of output 133 [2022-03-15 19:21:30,974 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 112 treesize of output 106 [2022-03-15 19:21:30,979 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 106 treesize of output 94 [2022-03-15 19:21:30,982 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 94 treesize of output 88 [2022-03-15 19:21:31,275 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 19:21:31,275 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777240605] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:31,275 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:21:31,275 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12, 9] total 27 [2022-03-15 19:21:31,275 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [170309240] [2022-03-15 19:21:31,275 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:31,278 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:31,287 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 65 transitions. [2022-03-15 19:21:31,287 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:21:31,722 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [11262#(or (< 0 |thread2Thread1of1ForFork2_~j~0#1|) (not (= |thread2Thread1of1ForFork2_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (+ |thread2Thread1of1ForFork2_~j~0#1| ~s~0)) (< ~q2_back~0 0)), 11263#(or (= (+ (* 2 ~t~0) 2 (* 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) ~s~0) (< 0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))] [2022-03-15 19:21:31,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:21:31,723 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:21:31,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:21:31,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=773, Unknown=1, NotChecked=56, Total=930 [2022-03-15 19:21:31,724 INFO L87 Difference]: Start difference. First operand 310 states and 876 transitions. Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 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:21:31,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:31,818 INFO L93 Difference]: Finished difference Result 381 states and 1071 transitions. [2022-03-15 19:21:31,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:21:31,819 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 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 26 [2022-03-15 19:21:31,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:31,821 INFO L225 Difference]: With dead ends: 381 [2022-03-15 19:21:31,821 INFO L226 Difference]: Without dead ends: 361 [2022-03-15 19:21:31,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=773, Unknown=1, NotChecked=56, Total=930 [2022-03-15 19:21:31,822 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 14 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 180 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:31,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 42 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 180 Unchecked, 0.1s Time] [2022-03-15 19:21:31,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-03-15 19:21:31,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 314. [2022-03-15 19:21:31,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 313 states have (on average 2.8210862619808306) internal successors, (883), 313 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:21:31,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 883 transitions. [2022-03-15 19:21:31,831 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 883 transitions. Word has length 26 [2022-03-15 19:21:31,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:31,831 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 883 transitions. [2022-03-15 19:21:31,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 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:21:31,831 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 883 transitions. [2022-03-15 19:21:31,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:21:31,832 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:31,832 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] [2022-03-15 19:21:31,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 19:21:32,057 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:21:32,058 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:21:32,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:32,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1568476415, now seen corresponding path program 8 times [2022-03-15 19:21:32,059 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:32,059 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558228654] [2022-03-15 19:21:32,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:32,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:32,645 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:32,645 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:32,645 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558228654] [2022-03-15 19:21:32,645 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558228654] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:32,645 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154430567] [2022-03-15 19:21:32,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:21:32,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:32,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:32,647 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:21:32,648 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:21:32,792 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 19:21:32,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:21:32,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 19:21:32,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:21:32,810 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:21:32,810 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 44 treesize of output 48 [2022-03-15 19:21:32,916 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 11 treesize of output 7 [2022-03-15 19:21:32,959 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:21:33,054 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-15 19:21:33,054 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2022-03-15 19:21:33,059 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 19 treesize of output 7 [2022-03-15 19:21:33,150 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 36 treesize of output 12 [2022-03-15 19:21:33,176 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 19:21:33,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 19:21:33,176 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154430567] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:21:33,176 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 19:21:33,177 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 18 [2022-03-15 19:21:33,177 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2129185170] [2022-03-15 19:21:33,177 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:33,180 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:33,192 INFO L252 McrAutomatonBuilder]: Finished intersection with 50 states and 75 transitions. [2022-03-15 19:21:33,193 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:21:34,140 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [12369#(and (or (< ~q2_front~0 0) (not (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= ~q2_back~0 ~q2_front~0) (= ~s~0 0)) (or (< 0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (+ ~t~0 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~s~0))), 12368#(and (or (< 0 |thread2Thread1of1ForFork2_~j~0#1|) (= (+ |thread2Thread1of1ForFork2_~j~0#1| ~s~0) 0) (not (= |thread2Thread1of1ForFork2_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< ~q2_back~0 0)) (or (< 0 |thread2Thread1of1ForFork2_~j~0#1|) (not (= |thread2Thread1of1ForFork2_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (= (+ |thread2Thread1of1ForFork2_~j~0#1| ~s~0) (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1)) (< ~q2_back~0 0)) (or (< 0 |thread2Thread1of1ForFork2_~j~0#1|) (= ~t~0 0) (not (= |thread2Thread1of1ForFork2_~j~0#1| (+ (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1))) (< ~q2_back~0 0)))] [2022-03-15 19:21:34,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:21:34,140 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:21:34,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:21:34,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2022-03-15 19:21:34,141 INFO L87 Difference]: Start difference. First operand 314 states and 883 transitions. Second operand has 11 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:21:34,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:34,363 INFO L93 Difference]: Finished difference Result 487 states and 1351 transitions. [2022-03-15 19:21:34,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:21:34,364 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:21:34,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:34,367 INFO L225 Difference]: With dead ends: 487 [2022-03-15 19:21:34,367 INFO L226 Difference]: Without dead ends: 467 [2022-03-15 19:21:34,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2022-03-15 19:21:34,367 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 54 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:34,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 44 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 221 Invalid, 0 Unknown, 59 Unchecked, 0.2s Time] [2022-03-15 19:21:34,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2022-03-15 19:21:34,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 310. [2022-03-15 19:21:34,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 2.8349514563106797) internal successors, (876), 309 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:21:34,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 876 transitions. [2022-03-15 19:21:34,377 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 876 transitions. Word has length 26 [2022-03-15 19:21:34,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:34,377 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 876 transitions. [2022-03-15 19:21:34,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:21:34,377 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 876 transitions. [2022-03-15 19:21:34,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:21:34,378 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:34,378 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:21:34,402 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:21:34,591 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:21:34,591 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:21:34,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:34,592 INFO L85 PathProgramCache]: Analyzing trace with hash -265081814, now seen corresponding path program 2 times [2022-03-15 19:21:34,593 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:34,593 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134164579] [2022-03-15 19:21:34,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:34,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:35,106 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:35,107 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:35,107 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134164579] [2022-03-15 19:21:35,107 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134164579] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:35,107 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894507506] [2022-03-15 19:21:35,107 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:21:35,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:35,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:35,108 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:21:35,110 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:21:35,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:21:35,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:21:35,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 19:21:35,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:21:35,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:21:35,658 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:21:35,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:21:35,742 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:21:35,898 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:21:35,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:21:36,062 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_647 (Array Int Int)) (~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_647))) (let ((.cse2 (select .cse3 ~q2~0.base))) (let ((.cse1 (select .cse2 (+ ~q2~0.offset (* c_~q2_back~0 4))))) (let ((.cse0 (+ .cse1 1))) (or (not (<= .cse0 0)) (= (+ c_~s~0 .cse1 1) (+ (* c_~t~0 2) (* 2 (select .cse2 (+ ~q2~0.offset (* c_~q2_front~0 4)))) 2)) (not (<= (select (select .cse3 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse0)))))))) is different from false [2022-03-15 19:21:36,086 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_647 (Array Int Int)) (v_ArrVal_646 (Array Int Int)) (~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_646) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_647))) (let ((.cse1 (select .cse3 ~q2~0.base))) (let ((.cse0 (select .cse1 (+ ~q2~0.offset (* c_~q2_back~0 4))))) (let ((.cse2 (+ .cse0 1))) (or (= (+ c_~s~0 .cse0 1) (+ (* c_~t~0 2) (* 2 (select .cse1 (+ ~q2~0.offset (* c_~q2_front~0 4)))) 2)) (not (<= .cse2 0)) (not (<= (select (select .cse3 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse2)))))))) is different from false [2022-03-15 19:21:36,182 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:21:36,182 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 680 treesize of output 692 [2022-03-15 19:21:36,208 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:21:36,208 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 527 treesize of output 509 [2022-03-15 19:21:36,232 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:21:36,232 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 514 treesize of output 430 [2022-03-15 19:21:50,233 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:21:50,234 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894507506] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:21:50,234 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:21:50,234 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 31 [2022-03-15 19:21:50,234 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [136000416] [2022-03-15 19:21:50,234 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:50,237 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:50,249 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 105 transitions. [2022-03-15 19:21:50,249 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:21:50,496 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:21:50,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:21:50,496 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:21:50,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:21:50,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=766, Unknown=2, NotChecked=114, Total=992 [2022-03-15 19:21:50,497 INFO L87 Difference]: Start difference. First operand 310 states and 876 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 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:21:50,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:50,790 INFO L93 Difference]: Finished difference Result 408 states and 1170 transitions. [2022-03-15 19:21:50,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 19:21:50,790 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 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:21:50,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:50,792 INFO L225 Difference]: With dead ends: 408 [2022-03-15 19:21:50,792 INFO L226 Difference]: Without dead ends: 408 [2022-03-15 19:21:50,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=110, Invalid=766, Unknown=2, NotChecked=114, Total=992 [2022-03-15 19:21:50,793 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 25 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:50,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 60 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:21:50,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-03-15 19:21:50,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 348. [2022-03-15 19:21:50,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 2.9279538904899134) internal successors, (1016), 347 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:21:50,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1016 transitions. [2022-03-15 19:21:50,802 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1016 transitions. Word has length 26 [2022-03-15 19:21:50,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:50,802 INFO L470 AbstractCegarLoop]: Abstraction has 348 states and 1016 transitions. [2022-03-15 19:21:50,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 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:21:50,802 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1016 transitions. [2022-03-15 19:21:50,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:21:50,803 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:50,803 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:21:50,827 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:21:51,027 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:21:51,027 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:21:51,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:51,028 INFO L85 PathProgramCache]: Analyzing trace with hash -789474778, now seen corresponding path program 3 times [2022-03-15 19:21:51,029 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:51,029 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858231627] [2022-03-15 19:21:51,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:51,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:51,484 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:51,484 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:51,484 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858231627] [2022-03-15 19:21:51,484 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858231627] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:51,484 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721467892] [2022-03-15 19:21:51,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:21:51,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:51,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:51,488 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:21:51,510 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:21:51,620 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:21:51,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:21:51,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 19:21:51,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:21:51,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:21:51,637 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:21:51,858 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:21:51,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:21:51,958 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:21:52,005 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-03-15 19:21:52,043 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:21:52,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:21:52,223 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:21:52,223 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 80 treesize of output 80 [2022-03-15 19:21:52,226 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 48 [2022-03-15 19:21:52,229 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 20 [2022-03-15 19:21:52,481 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:21:52,481 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721467892] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:21:52,481 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:21:52,481 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 28 [2022-03-15 19:21:52,481 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1645244374] [2022-03-15 19:21:52,482 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:52,485 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:52,498 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 114 transitions. [2022-03-15 19:21:52,498 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:21:53,037 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [14944#(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:21:53,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:21:53,037 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:21:53,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:21:53,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=719, Unknown=5, NotChecked=0, Total=870 [2022-03-15 19:21:53,038 INFO L87 Difference]: Start difference. First operand 348 states and 1016 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 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:21:53,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:53,281 INFO L93 Difference]: Finished difference Result 514 states and 1445 transitions. [2022-03-15 19:21:53,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 19:21:53,281 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 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 26 [2022-03-15 19:21:53,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:53,284 INFO L225 Difference]: With dead ends: 514 [2022-03-15 19:21:53,284 INFO L226 Difference]: Without dead ends: 506 [2022-03-15 19:21:53,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=719, Unknown=5, NotChecked=0, Total=870 [2022-03-15 19:21:53,285 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 48 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:53,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 59 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:21:53,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2022-03-15 19:21:53,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 393. [2022-03-15 19:21:53,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 2.979591836734694) internal successors, (1168), 392 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:21:53,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1168 transitions. [2022-03-15 19:21:53,294 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 1168 transitions. Word has length 26 [2022-03-15 19:21:53,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:53,295 INFO L470 AbstractCegarLoop]: Abstraction has 393 states and 1168 transitions. [2022-03-15 19:21:53,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 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:21:53,295 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 1168 transitions. [2022-03-15 19:21:53,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:21:53,296 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:53,296 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:21:53,323 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:21:53,523 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:21:53,524 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:21:53,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:53,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1118763228, now seen corresponding path program 4 times [2022-03-15 19:21:53,525 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:53,525 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692053371] [2022-03-15 19:21:53,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:53,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:53,924 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:21:53,925 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:53,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692053371] [2022-03-15 19:21:53,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692053371] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:53,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201419623] [2022-03-15 19:21:53,925 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:21:53,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:53,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:53,926 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:21:53,929 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:21:54,039 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:21:54,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:21:54,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-15 19:21:54,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:21:54,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:21:54,333 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:21:54,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:21:54,397 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:21:54,453 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-03-15 19:21:54,504 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:54,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:21:54,710 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:21:54,711 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 80 treesize of output 80 [2022-03-15 19:21:54,714 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 48 [2022-03-15 19:21:54,717 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 20 [2022-03-15 19:21:55,075 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:55,075 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201419623] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:21:55,075 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:21:55,075 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 32 [2022-03-15 19:21:55,075 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [818535001] [2022-03-15 19:21:55,075 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:55,079 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:55,095 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 114 transitions. [2022-03-15 19:21:55,096 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:21:55,663 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [16428#(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:21:55,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:21:55,664 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:21:55,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:21:55,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=943, Unknown=3, NotChecked=0, Total=1122 [2022-03-15 19:21:55,664 INFO L87 Difference]: Start difference. First operand 393 states and 1168 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:21:55,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:55,969 INFO L93 Difference]: Finished difference Result 566 states and 1608 transitions. [2022-03-15 19:21:55,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:21:55,969 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:21:55,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:55,972 INFO L225 Difference]: With dead ends: 566 [2022-03-15 19:21:55,972 INFO L226 Difference]: Without dead ends: 566 [2022-03-15 19:21:55,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=192, Invalid=1065, Unknown=3, NotChecked=0, Total=1260 [2022-03-15 19:21:55,972 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 59 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:55,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 49 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:21:55,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2022-03-15 19:21:55,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 373. [2022-03-15 19:21:55,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 372 states have (on average 2.9301075268817205) internal successors, (1090), 372 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:21:55,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1090 transitions. [2022-03-15 19:21:55,982 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1090 transitions. Word has length 26 [2022-03-15 19:21:55,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:55,983 INFO L470 AbstractCegarLoop]: Abstraction has 373 states and 1090 transitions. [2022-03-15 19:21:55,983 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:21:55,983 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1090 transitions. [2022-03-15 19:21:55,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:21:55,984 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:55,984 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:21:56,001 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:21:56,184 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:21:56,185 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:21:56,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:56,185 INFO L85 PathProgramCache]: Analyzing trace with hash -164874070, now seen corresponding path program 5 times [2022-03-15 19:21:56,186 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:56,186 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117113623] [2022-03-15 19:21:56,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:56,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:56,386 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:21:56,386 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:56,386 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117113623] [2022-03-15 19:21:56,386 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117113623] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:56,386 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231058625] [2022-03-15 19:21:56,386 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:21:56,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:56,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:56,388 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:21:56,413 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:21:56,527 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:21:56,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:21:56,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-15 19:21:56,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:21:56,730 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:21:56,792 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:21:56,863 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:21:56,924 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:21:57,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:57,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:21:57,761 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:21:57,761 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 201 treesize of output 141 [2022-03-15 19:21:57,852 INFO L353 Elim1Store]: treesize reduction 17, result has 84.4 percent of original size [2022-03-15 19:21:57,853 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 16146 treesize of output 15101 [2022-03-15 19:21:57,929 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:21:57,970 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:21:57,971 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 14496 treesize of output 13724 [2022-03-15 19:21:58,054 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:21:58,117 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:21:58,118 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 14158 treesize of output 12534 [2022-03-15 19:21:58,201 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:21:58,244 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:21:58,245 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 12454 treesize of output 9126 Received shutdown request... [2022-03-15 19:31:13,282 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-03-15 19:31:13,284 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-03-15 19:31:13,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 19:31:13,313 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:31:13,313 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:31:13,485 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:31:13,485 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 24ms.. [2022-03-15 19:31:13,487 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 19:31:13,487 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 19:31:13,487 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 19:31:13,488 INFO L732 BasicCegarLoop]: Path program histogram: [8, 5, 1, 1, 1, 1] [2022-03-15 19:31:13,490 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 19:31:13,490 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 19:31:13,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 07:31:13 BasicIcfg [2022-03-15 19:31:13,492 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 19:31:13,492 INFO L158 Benchmark]: Toolchain (without parser) took 792121.38ms. Allocated memory was 180.4MB in the beginning and 871.4MB in the end (delta: 691.0MB). Free memory was 125.4MB in the beginning and 301.9MB in the end (delta: -176.5MB). Peak memory consumption was 536.2MB. Max. memory is 8.0GB. [2022-03-15 19:31:13,492 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 180.4MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 19:31:13,493 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.34ms. Allocated memory was 180.4MB in the beginning and 290.5MB in the end (delta: 110.1MB). Free memory was 125.2MB in the beginning and 259.2MB in the end (delta: -133.9MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. [2022-03-15 19:31:13,493 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.92ms. Allocated memory is still 290.5MB. Free memory was 259.2MB in the beginning and 256.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:31:13,493 INFO L158 Benchmark]: Boogie Preprocessor took 39.54ms. Allocated memory is still 290.5MB. Free memory was 256.6MB in the beginning and 255.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:31:13,493 INFO L158 Benchmark]: RCFGBuilder took 727.46ms. Allocated memory is still 290.5MB. Free memory was 254.8MB in the beginning and 226.8MB in the end (delta: 28.0MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-03-15 19:31:13,493 INFO L158 Benchmark]: TraceAbstraction took 791048.46ms. Allocated memory was 290.5MB in the beginning and 871.4MB in the end (delta: 580.9MB). Free memory was 226.2MB in the beginning and 301.9MB in the end (delta: -75.7MB). Peak memory consumption was 528.2MB. Max. memory is 8.0GB. [2022-03-15 19:31:13,494 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.13ms. Allocated memory is still 180.4MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 258.34ms. Allocated memory was 180.4MB in the beginning and 290.5MB in the end (delta: 110.1MB). Free memory was 125.2MB in the beginning and 259.2MB in the end (delta: -133.9MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.92ms. Allocated memory is still 290.5MB. Free memory was 259.2MB in the beginning and 256.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.54ms. Allocated memory is still 290.5MB. Free memory was 256.6MB in the beginning and 255.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 727.46ms. Allocated memory is still 290.5MB. Free memory was 254.8MB in the beginning and 226.8MB in the end (delta: 28.0MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * TraceAbstraction took 791048.46ms. Allocated memory was 290.5MB in the beginning and 871.4MB in the end (delta: 580.9MB). Free memory was 226.2MB in the beginning and 301.9MB in the end (delta: -75.7MB). Peak memory consumption was 528.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.7s, 203 PlacesBefore, 36 PlacesAfterwards, 211 TransitionsBefore, 32 TransitionsAfterwards, 1456 CoEnabledTransitionPairs, 8 FixpointIterations, 143 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 20 TrivialYvCompositions, 12 ConcurrentYvCompositions, 12 ChoiceCompositions, 215 TotalNumberOfCompositions, 2278 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1625, positive: 1547, positive conditional: 0, positive unconditional: 1547, 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: 816, positive: 798, positive conditional: 0, positive unconditional: 798, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1625, positive: 749, positive conditional: 0, positive unconditional: 749, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 816, unknown conditional: 0, unknown unconditional: 816] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 53, Positive conditional cache size: 0, Positive unconditional cache size: 53, 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: 127]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 24ms.. - 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 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 24ms.. - TimeoutResultAtElement [Line: 121]: 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 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 24ms.. - 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 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 24ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 224 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 790.9s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 638 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 638 mSDsluCounter, 736 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 556 IncrementalHoareTripleChecker+Unchecked, 2033 mSDsCounter, 185 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4466 IncrementalHoareTripleChecker+Invalid, 5207 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 185 mSolverCounterUnsat, 107 mSDtfsCounter, 4466 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1086 GetRequests, 738 SyntacticMatches, 21 SemanticMatches, 327 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2332 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=393occurred in iteration=15, InterpolantAutomatonStates: 144, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 1279 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 193.0s InterpolantComputationTime, 673 NumberOfCodeBlocks, 663 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 841 ConstructedInterpolants, 103 QuantifiedInterpolants, 24805 SizeOfPredicates, 193 NumberOfNonLiveVariables, 3397 ConjunctsInSsa, 488 ConjunctsInUnsatCore, 35 InterpolantComputations, 9 PerfectInterpolantSequences, 50/143 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