/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/chl-word-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 18:49:21,635 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 18:49:21,637 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 18:49:21,677 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 18:49:21,678 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 18:49:21,680 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 18:49:21,682 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 18:49:21,685 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 18:49:21,687 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 18:49:21,690 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 18:49:21,691 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 18:49:21,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 18:49:21,693 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 18:49:21,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 18:49:21,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 18:49:21,698 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 18:49:21,699 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 18:49:21,699 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 18:49:21,701 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 18:49:21,706 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 18:49:21,707 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 18:49:21,708 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 18:49:21,709 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 18:49:21,710 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 18:49:21,715 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 18:49:21,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 18:49:21,716 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 18:49:21,717 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 18:49:21,717 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 18:49:21,718 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 18:49:21,718 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 18:49:21,719 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 18:49:21,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 18:49:21,721 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 18:49:21,722 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 18:49:21,722 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 18:49:21,723 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 18:49:21,723 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 18:49:21,723 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 18:49:21,724 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 18:49:21,724 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 18:49:21,725 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 18:49:21,754 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 18:49:21,754 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 18:49:21,755 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 18:49:21,755 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 18:49:21,755 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 18:49:21,756 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 18:49:21,756 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 18:49:21,756 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 18:49:21,756 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 18:49:21,756 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 18:49:21,757 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 18:49:21,757 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 18:49:21,757 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 18:49:21,757 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 18:49:21,757 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 18:49:21,757 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 18:49:21,757 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 18:49:21,758 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 18:49:21,758 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 18:49:21,758 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 18:49:21,758 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 18:49:21,758 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 18:49:21,758 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 18:49:21,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 18:49:21,758 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 18:49:21,759 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 18:49:21,759 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 18:49:21,760 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 18:49:21,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 18:49:21,760 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 18:49:21,760 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 18:49:21,760 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 18:49:21,760 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 18:49:21,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 18:49:21,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 18:49:21,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 18:49:21,987 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 18:49:21,991 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 18:49:21,992 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-word-trans.wvr.c [2022-03-15 18:49:22,048 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c74381f19/dde557f7b17143f6aaae6ef516157902/FLAG1e38042cd [2022-03-15 18:49:22,431 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 18:49:22,432 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-word-trans.wvr.c [2022-03-15 18:49:22,438 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c74381f19/dde557f7b17143f6aaae6ef516157902/FLAG1e38042cd [2022-03-15 18:49:22,836 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c74381f19/dde557f7b17143f6aaae6ef516157902 [2022-03-15 18:49:22,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 18:49:22,839 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 18:49:22,845 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 18:49:22,845 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 18:49:22,847 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 18:49:22,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 06:49:22" (1/1) ... [2022-03-15 18:49:22,848 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6183453e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:49:22, skipping insertion in model container [2022-03-15 18:49:22,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 06:49:22" (1/1) ... [2022-03-15 18:49:22,869 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 18:49:22,894 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 18:49:23,055 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/chl-word-trans.wvr.c[3292,3305] [2022-03-15 18:49:23,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 18:49:23,066 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 18:49:23,089 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/chl-word-trans.wvr.c[3292,3305] [2022-03-15 18:49:23,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 18:49:23,103 INFO L208 MainTranslator]: Completed translation [2022-03-15 18:49:23,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:49:23 WrapperNode [2022-03-15 18:49:23,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 18:49:23,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 18:49:23,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 18:49:23,104 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 18:49:23,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:49:23" (1/1) ... [2022-03-15 18:49:23,118 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:49:23" (1/1) ... [2022-03-15 18:49:23,147 INFO L137 Inliner]: procedures = 25, calls = 44, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 172 [2022-03-15 18:49:23,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 18:49:23,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 18:49:23,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 18:49:23,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 18:49:23,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:49:23" (1/1) ... [2022-03-15 18:49:23,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:49:23" (1/1) ... [2022-03-15 18:49:23,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:49:23" (1/1) ... [2022-03-15 18:49:23,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:49:23" (1/1) ... [2022-03-15 18:49:23,167 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:49:23" (1/1) ... [2022-03-15 18:49:23,171 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:49:23" (1/1) ... [2022-03-15 18:49:23,173 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:49:23" (1/1) ... [2022-03-15 18:49:23,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 18:49:23,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 18:49:23,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 18:49:23,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 18:49:23,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:49:23" (1/1) ... [2022-03-15 18:49:23,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 18:49:23,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:49:23,219 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 18:49:23,246 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 18:49:23,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 18:49:23,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 18:49:23,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 18:49:23,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 18:49:23,267 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 18:49:23,267 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 18:49:23,267 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 18:49:23,267 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 18:49:23,267 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 18:49:23,268 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 18:49:23,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 18:49:23,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 18:49:23,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 18:49:23,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 18:49:23,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 18:49:23,271 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 18:49:23,356 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 18:49:23,358 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 18:49:23,721 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 18:49:23,730 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 18:49:23,731 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-03-15 18:49:23,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 06:49:23 BoogieIcfgContainer [2022-03-15 18:49:23,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 18:49:23,734 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 18:49:23,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 18:49:23,736 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 18:49:23,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 06:49:22" (1/3) ... [2022-03-15 18:49:23,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36e7aeed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 06:49:23, skipping insertion in model container [2022-03-15 18:49:23,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:49:23" (2/3) ... [2022-03-15 18:49:23,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36e7aeed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 06:49:23, skipping insertion in model container [2022-03-15 18:49:23,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 06:49:23" (3/3) ... [2022-03-15 18:49:23,739 INFO L111 eAbstractionObserver]: Analyzing ICFG chl-word-trans.wvr.c [2022-03-15 18:49:23,742 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 18:49:23,742 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 18:49:23,743 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 18:49:23,743 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 18:49:23,819 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~stop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,819 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~stop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,819 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,819 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,820 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,820 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,821 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,821 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,821 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,822 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,822 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,822 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,822 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~stop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,822 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~stop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,823 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~stop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,823 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~stop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,824 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,824 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,825 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,825 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,825 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,826 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,826 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,826 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,827 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,827 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,827 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,827 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,829 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,829 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,830 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,830 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,830 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,830 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,830 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,830 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,831 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,831 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,831 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,831 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,831 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,831 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,831 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,831 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,832 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,832 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,832 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,832 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,832 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,832 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,833 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,833 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,833 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,833 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,833 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,834 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,834 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,834 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,834 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,835 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,835 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,835 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,836 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,836 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,836 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,836 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,836 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,836 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,836 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,837 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,837 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,837 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,837 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,837 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,839 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,839 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,839 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,840 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,841 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~stop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,841 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~stop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,842 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~stop~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,843 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~stop~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,845 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,849 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,850 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,851 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,852 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,852 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,852 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,852 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,852 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,852 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,853 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~stop~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,853 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~stop~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,853 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~stop~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,854 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~stop~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,854 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,854 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,854 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,855 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,855 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,855 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,856 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,856 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,856 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,856 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,856 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,856 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,857 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,857 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,858 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,858 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,858 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,858 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,858 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,858 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,859 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,859 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,859 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,859 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,859 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,859 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,859 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,860 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,860 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,860 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,860 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,860 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,860 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,860 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,862 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,862 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,862 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,862 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,863 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,863 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,863 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,863 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,863 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,863 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,864 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,864 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,864 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,864 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,864 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,864 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,864 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,865 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,866 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,866 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,866 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,866 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,867 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,867 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,867 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,867 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,867 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,867 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,868 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,868 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,868 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,868 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,868 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,868 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,868 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,868 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,868 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~stop~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,869 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~stop~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,871 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~stop~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,872 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~stop~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,872 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,872 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,872 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,873 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,873 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,874 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,874 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,874 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,874 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,874 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,874 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~stop~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,875 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~stop~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,875 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~stop~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,876 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~stop~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,876 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,876 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,876 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,876 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,877 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,877 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,878 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,878 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,878 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,878 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,878 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,878 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,878 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,879 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,880 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,881 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,883 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,884 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,885 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,885 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,885 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,885 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,885 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,885 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,886 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,886 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,891 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,892 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,892 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,892 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,892 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,892 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,892 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,893 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,893 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,893 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,893 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,893 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,893 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,894 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,894 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,894 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,894 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,894 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,894 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,894 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,895 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,895 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,895 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,895 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,895 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,896 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,896 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,896 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,896 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,897 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,897 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,897 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,897 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,897 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,897 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,898 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~stop~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,898 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~stop~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,902 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,902 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,902 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,903 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,903 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,903 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~stop~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,903 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,903 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,903 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,903 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,903 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,906 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,906 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,907 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,907 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,907 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,907 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,907 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,907 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,907 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,907 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~stop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,908 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,909 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,909 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,909 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,909 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,909 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~stop~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,909 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,909 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,909 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,910 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,910 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,910 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:49:23,917 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 18:49:23,968 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 18:49:23,973 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 18:49:23,974 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 18:49:23,987 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 18:49:23,995 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 308 places, 332 transitions, 688 flow [2022-03-15 18:49:23,997 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 308 places, 332 transitions, 688 flow [2022-03-15 18:49:23,998 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 308 places, 332 transitions, 688 flow [2022-03-15 18:49:24,121 INFO L129 PetriNetUnfolder]: 34/329 cut-off events. [2022-03-15 18:49:24,121 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 18:49:24,130 INFO L84 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 329 events. 34/329 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 506 event pairs, 0 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 261. Up to 3 conditions per place. [2022-03-15 18:49:24,139 INFO L116 LiptonReduction]: Number of co-enabled transitions 12480 [2022-03-15 18:49:33,594 INFO L131 LiptonReduction]: Checked pairs total: 15018 [2022-03-15 18:49:33,594 INFO L133 LiptonReduction]: Total number of compositions: 357 [2022-03-15 18:49:33,606 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 43 transitions, 110 flow [2022-03-15 18:49:33,677 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 349 states, 348 states have (on average 4.080459770114943) internal successors, (1420), 348 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:33,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 349 states, 348 states have (on average 4.080459770114943) internal successors, (1420), 348 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:33,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 18:49:33,700 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:49:33,701 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:49:33,702 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 18:49:33,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:49:33,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1818663427, now seen corresponding path program 1 times [2022-03-15 18:49:33,724 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:49:33,725 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532969233] [2022-03-15 18:49:33,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:49:33,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:49:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:49:34,114 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 18:49:34,115 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:49:34,115 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532969233] [2022-03-15 18:49:34,115 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532969233] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:49:34,115 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:49:34,116 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 18:49:34,117 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [646113176] [2022-03-15 18:49:34,117 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:49:34,122 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:49:34,145 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 83 transitions. [2022-03-15 18:49:34,145 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:49:35,855 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [1021#(and (or (= ~res2~0 1) (= (+ ~res2~0 1) 0) (= ~count2~0 ~count1~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 2) ~count1~0) (<= ~count1~0 ~count2~0))), 1018#(or (= (+ ~res2~0 1) 0) (<= ~count1~0 ~count2~0) (= ~res3~0 ~res2~0)), 1020#(and (or (= ~res2~0 1) (= ~count3~0 ~count1~0) (= (+ ~res2~0 1) 0) (<= ~count1~0 ~count2~0)) (or (= ~count3~0 ~count1~0) (= (+ ~res2~0 1) 0) (< ~count3~0 ~count1~0) (<= ~count1~0 ~count2~0))), 1014#(and (or (= ~res2~0 1) (= ~count3~0 ~count1~0) (<= (+ ~res1~0 1) 0) (= (+ ~res2~0 1) 0)) (or (= ~count3~0 ~count1~0) (<= (+ ~res1~0 1) 0) (= (+ ~res2~0 1) 0) (< ~count3~0 ~count1~0))), 1016#(or (= ~count3~0 ~count1~0) (not (< ~count3~0 ~count2~0)) (<= (+ ~res1~0 1) 0) (< ~count3~0 ~count1~0)), 1015#(or (not (< ~count3~0 ~count2~0)) (<= (+ ~res1~0 1) 0) (= ~res3~0 1)), 1017#(or (not (< ~count3~0 ~count2~0)) (<= (+ ~res1~0 1) 0) (<= (+ ~count3~0 2) ~count1~0)), 1019#(or (<= ~count1~0 ~count2~0) (<= ~count2~0 ~count3~0) (= ~res3~0 1))] [2022-03-15 18:49:35,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 18:49:35,857 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:49:35,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 18:49:35,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-03-15 18:49:35,880 INFO L87 Difference]: Start difference. First operand has 349 states, 348 states have (on average 4.080459770114943) internal successors, (1420), 348 states have internal predecessors, (1420), 0 states have call successors, (0), 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 13 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:38,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:49:38,490 INFO L93 Difference]: Finished difference Result 1250 states and 3885 transitions. [2022-03-15 18:49:38,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 18:49:38,491 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 18:49:38,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:49:38,512 INFO L225 Difference]: With dead ends: 1250 [2022-03-15 18:49:38,512 INFO L226 Difference]: Without dead ends: 1243 [2022-03-15 18:49:38,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=620, Invalid=2032, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 18:49:38,516 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 742 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 1349 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 18:49:38,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [742 Valid, 45 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1349 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 18:49:38,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2022-03-15 18:49:38,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 377. [2022-03-15 18:49:38,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 3.973404255319149) internal successors, (1494), 376 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:38,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1494 transitions. [2022-03-15 18:49:38,610 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1494 transitions. Word has length 19 [2022-03-15 18:49:38,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:49:38,611 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 1494 transitions. [2022-03-15 18:49:38,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:38,611 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1494 transitions. [2022-03-15 18:49:38,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 18:49:38,615 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:49:38,615 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] [2022-03-15 18:49:38,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 18:49:38,615 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 18:49:38,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:49:38,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1815871884, now seen corresponding path program 1 times [2022-03-15 18:49:38,618 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:49:38,622 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442145498] [2022-03-15 18:49:38,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:49:38,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:49:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:49:38,743 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 18:49:38,743 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:49:38,744 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442145498] [2022-03-15 18:49:38,744 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442145498] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:49:38,744 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:49:38,744 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 18:49:38,744 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [267615004] [2022-03-15 18:49:38,744 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:49:38,748 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:49:38,760 INFO L252 McrAutomatonBuilder]: Finished intersection with 61 states and 117 transitions. [2022-03-15 18:49:38,761 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:49:40,243 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [3150#(or (= ~count3~0 ~count1~0) (< ~count3~0 ~count1~0) (<= ~count2~0 ~count3~0)), 3153#(or (= ~count3~0 ~count1~0) (= (+ ~res2~0 1) 0) (< ~count3~0 ~count1~0) (not (= ~count2~0 ~count1~0))), 3149#(or (= ~count3~0 ~count1~0) (= (+ ~res2~0 1) 0) (< ~count3~0 ~count1~0)), 3152#(or (= (+ ~res2~0 1) 0) (= ~res3~0 1) (not (= ~count2~0 ~count1~0))), 3155#(or (<= ~count2~0 ~count3~0) (= ~res3~0 1) (not (= ~count2~0 ~count1~0))), 3154#(or (= (+ ~res2~0 1) 0) (not (= ~count2~0 ~count1~0)) (<= (+ ~count3~0 1) ~count1~0)), 3151#(or (not (< ~count3~0 ~count2~0)) (<= (+ ~count3~0 1) ~count1~0)), 3148#(or (not (< ~count3~0 ~count2~0)) (= ~res3~0 1))] [2022-03-15 18:49:40,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 18:49:40,244 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:49:40,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 18:49:40,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-03-15 18:49:40,245 INFO L87 Difference]: Start difference. First operand 377 states and 1494 transitions. Second operand has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:41,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:49:41,573 INFO L93 Difference]: Finished difference Result 1016 states and 3151 transitions. [2022-03-15 18:49:41,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 18:49:41,574 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 18:49:41,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:49:41,580 INFO L225 Difference]: With dead ends: 1016 [2022-03-15 18:49:41,580 INFO L226 Difference]: Without dead ends: 999 [2022-03-15 18:49:41,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 57 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=466, Invalid=1340, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 18:49:41,582 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 488 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 18:49:41,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [488 Valid, 18 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 18:49:41,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2022-03-15 18:49:41,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 391. [2022-03-15 18:49:41,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 390 states have (on average 3.917948717948718) internal successors, (1528), 390 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:41,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1528 transitions. [2022-03-15 18:49:41,615 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1528 transitions. Word has length 20 [2022-03-15 18:49:41,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:49:41,615 INFO L470 AbstractCegarLoop]: Abstraction has 391 states and 1528 transitions. [2022-03-15 18:49:41,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:41,616 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1528 transitions. [2022-03-15 18:49:41,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 18:49:41,617 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:49:41,617 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] [2022-03-15 18:49:41,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 18:49:41,618 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 18:49:41,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:49:41,618 INFO L85 PathProgramCache]: Analyzing trace with hash 2120338253, now seen corresponding path program 1 times [2022-03-15 18:49:41,619 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:49:41,620 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231670642] [2022-03-15 18:49:41,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:49:41,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:49:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:49:41,786 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 18:49:41,786 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:49:41,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231670642] [2022-03-15 18:49:41,787 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231670642] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:49:41,787 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:49:41,787 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 18:49:41,787 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1727846989] [2022-03-15 18:49:41,787 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:49:41,791 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:49:41,802 INFO L252 McrAutomatonBuilder]: Finished intersection with 61 states and 117 transitions. [2022-03-15 18:49:41,802 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:49:43,017 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [5050#(or (<= (+ ~res1~0 1) 0) (= (+ ~res2~0 1) 0) (not (= ~count3~0 ~count1~0))), 5051#(or (<= (+ ~res1~0 1) 0) (<= ~count2~0 ~count3~0) (not (= ~count3~0 ~count1~0))), 5054#(or (= (+ ~res2~0 1) 0) (<= ~count1~0 ~count2~0) (not (= ~count3~0 ~count1~0))), 5055#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 2) ~count1~0) (<= ~count1~0 ~count2~0)), 5052#(or (= (+ ~res2~0 1) 0) (<= ~count1~0 ~count2~0)), 5053#(or (<= ~count1~0 ~count2~0) (<= ~count2~0 ~count3~0)), 5056#(or (not (< ~count3~0 ~count2~0)) (<= (+ ~res1~0 1) 0) (<= (+ ~count3~0 2) ~count1~0)), 5049#(or (not (< ~count3~0 ~count2~0)) (<= (+ ~res1~0 1) 0))] [2022-03-15 18:49:43,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 18:49:43,017 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:49:43,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 18:49:43,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-03-15 18:49:43,018 INFO L87 Difference]: Start difference. First operand 391 states and 1528 transitions. Second operand has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:43,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:49:43,865 INFO L93 Difference]: Finished difference Result 916 states and 3009 transitions. [2022-03-15 18:49:43,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 18:49:43,866 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 18:49:43,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:49:43,871 INFO L225 Difference]: With dead ends: 916 [2022-03-15 18:49:43,871 INFO L226 Difference]: Without dead ends: 895 [2022-03-15 18:49:43,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=254, Invalid=676, Unknown=0, NotChecked=0, Total=930 [2022-03-15 18:49:43,872 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 444 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 18:49:43,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [444 Valid, 18 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 18:49:43,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2022-03-15 18:49:43,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 407. [2022-03-15 18:49:43,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 3.8669950738916254) internal successors, (1570), 406 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:43,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1570 transitions. [2022-03-15 18:49:43,891 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1570 transitions. Word has length 20 [2022-03-15 18:49:43,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:49:43,892 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 1570 transitions. [2022-03-15 18:49:43,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:43,892 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1570 transitions. [2022-03-15 18:49:43,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 18:49:43,893 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:49:43,893 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] [2022-03-15 18:49:43,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 18:49:43,894 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 18:49:43,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:49:43,894 INFO L85 PathProgramCache]: Analyzing trace with hash 833724384, now seen corresponding path program 1 times [2022-03-15 18:49:43,895 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:49:43,895 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874705315] [2022-03-15 18:49:43,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:49:43,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:49:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:49:43,984 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 18:49:43,984 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:49:43,984 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874705315] [2022-03-15 18:49:43,985 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874705315] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:49:43,985 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:49:43,985 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 18:49:43,985 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [179160267] [2022-03-15 18:49:43,985 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:49:43,989 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:49:43,999 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 123 transitions. [2022-03-15 18:49:43,999 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:49:45,902 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [6850#(and (or (< 0 ~res3~0) (<= ~res2~0 0)) (or (< 0 ~res3~0) (<= ~n2~0 ~n3~0))), 6851#(or (<= ~res2~0 0) (<= ~res1~0 0)), 6849#(or (< 0 ~res3~0) (<= ~res2~0 0)), 6854#(and (<= ~n2~0 ~n3~0) (<= ~res2~0 0)), 6852#(and (or (<= ~n2~0 ~n3~0) (<= ~res1~0 0)) (or (<= ~res2~0 0) (<= ~res1~0 0))), 6848#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (or (< 0 ~res3~0) (<= ~n2~0 ~n3~0) (<= ~res1~0 0))), 6853#(<= ~res2~0 0)] [2022-03-15 18:49:45,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 18:49:45,903 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:49:45,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 18:49:45,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2022-03-15 18:49:45,904 INFO L87 Difference]: Start difference. First operand 407 states and 1570 transitions. Second operand has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:46,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:49:46,129 INFO L93 Difference]: Finished difference Result 819 states and 3189 transitions. [2022-03-15 18:49:46,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 18:49:46,130 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 18:49:46,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:49:46,135 INFO L225 Difference]: With dead ends: 819 [2022-03-15 18:49:46,135 INFO L226 Difference]: Without dead ends: 758 [2022-03-15 18:49:46,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2022-03-15 18:49:46,142 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 278 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:49:46,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 10 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:49:46,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2022-03-15 18:49:46,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 610. [2022-03-15 18:49:46,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 609 states have (on average 3.9655172413793105) internal successors, (2415), 609 states have internal predecessors, (2415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:46,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 2415 transitions. [2022-03-15 18:49:46,165 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 2415 transitions. Word has length 20 [2022-03-15 18:49:46,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:49:46,166 INFO L470 AbstractCegarLoop]: Abstraction has 610 states and 2415 transitions. [2022-03-15 18:49:46,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:46,167 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 2415 transitions. [2022-03-15 18:49:46,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 18:49:46,169 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:49:46,169 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 18:49:46,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 18:49:46,169 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 18:49:46,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:49:46,172 INFO L85 PathProgramCache]: Analyzing trace with hash 47924763, now seen corresponding path program 1 times [2022-03-15 18:49:46,172 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:49:46,173 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243203357] [2022-03-15 18:49:46,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:49:46,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:49:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:49:46,282 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 18:49:46,282 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:49:46,282 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243203357] [2022-03-15 18:49:46,282 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243203357] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:49:46,282 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:49:46,282 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 18:49:46,283 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1441686362] [2022-03-15 18:49:46,283 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:49:46,287 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:49:46,298 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 124 transitions. [2022-03-15 18:49:46,298 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:49:47,371 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [8907#(or (= ~count3~0 ~count1~0) (not (= ~count3~0 ~count2~0)) (<= (+ ~res1~0 1) 0) (< ~count3~0 ~count1~0)), 8909#(or (<= (+ ~count2~0 1) ~count3~0) (<= ~count1~0 ~count2~0) (= ~res3~0 1)), 8904#(or (= ~count3~0 ~count1~0) (<= (+ ~res1~0 1) 0) (< ~count3~0 ~count1~0)), 8906#(or (not (= ~count3~0 ~count2~0)) (<= (+ ~res1~0 1) 0) (= ~res3~0 1)), 8905#(or (= ~count3~0 ~count1~0) (< ~count3~0 ~count1~0) (<= ~count1~0 ~count2~0)), 8903#(or (<= ~count1~0 ~count2~0) (= ~res3~0 1)), 8908#(or (not (= ~count3~0 ~count2~0)) (<= ~count1~0 ~count2~0) (= ~res3~0 1))] [2022-03-15 18:49:47,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 18:49:47,372 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:49:47,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 18:49:47,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-03-15 18:49:47,373 INFO L87 Difference]: Start difference. First operand 610 states and 2415 transitions. Second operand has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:48,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:49:48,216 INFO L93 Difference]: Finished difference Result 1393 states and 4915 transitions. [2022-03-15 18:49:48,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 18:49:48,216 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 18:49:48,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:49:48,224 INFO L225 Difference]: With dead ends: 1393 [2022-03-15 18:49:48,224 INFO L226 Difference]: Without dead ends: 1354 [2022-03-15 18:49:48,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=250, Invalid=620, Unknown=0, NotChecked=0, Total=870 [2022-03-15 18:49:48,225 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 397 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 18:49:48,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [397 Valid, 19 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 18:49:48,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2022-03-15 18:49:48,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 658. [2022-03-15 18:49:48,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 657 states have (on average 3.8767123287671232) internal successors, (2547), 657 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:48,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 2547 transitions. [2022-03-15 18:49:48,250 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 2547 transitions. Word has length 21 [2022-03-15 18:49:48,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:49:48,251 INFO L470 AbstractCegarLoop]: Abstraction has 658 states and 2547 transitions. [2022-03-15 18:49:48,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:48,251 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 2547 transitions. [2022-03-15 18:49:48,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 18:49:48,253 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:49:48,253 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 18:49:48,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 18:49:48,253 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 18:49:48,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:49:48,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1173184098, now seen corresponding path program 1 times [2022-03-15 18:49:48,255 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:49:48,255 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578373029] [2022-03-15 18:49:48,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:49:48,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:49:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:49:48,320 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 18:49:48,320 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:49:48,320 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578373029] [2022-03-15 18:49:48,321 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578373029] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:49:48,321 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:49:48,321 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 18:49:48,321 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [314513405] [2022-03-15 18:49:48,321 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:49:48,325 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:49:48,341 INFO L252 McrAutomatonBuilder]: Finished intersection with 79 states and 163 transitions. [2022-03-15 18:49:48,342 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:49:49,156 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [11678#(not (= ~count2~0 ~count1~0)), 11679#(or (= ~count3~0 ~count2~0) (not (= ~count2~0 ~count1~0))), 11681#(or (not (= ~count3~0 ~count1~0)) (not (= ~count2~0 ~count1~0))), 11680#(or (= ~count3~0 ~count2~0) (<= (+ ~count1~0 1) ~count3~0) (<= (+ ~count3~0 1) ~count1~0)), 11677#(= ~count3~0 ~count2~0)] [2022-03-15 18:49:49,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 18:49:49,156 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:49:49,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 18:49:49,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-03-15 18:49:49,157 INFO L87 Difference]: Start difference. First operand 658 states and 2547 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:49,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:49:49,428 INFO L93 Difference]: Finished difference Result 884 states and 3145 transitions. [2022-03-15 18:49:49,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 18:49:49,429 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 18:49:49,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:49:49,433 INFO L225 Difference]: With dead ends: 884 [2022-03-15 18:49:49,433 INFO L226 Difference]: Without dead ends: 794 [2022-03-15 18:49:49,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-03-15 18:49:49,434 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 156 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:49:49,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 11 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:49:49,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2022-03-15 18:49:49,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 546. [2022-03-15 18:49:49,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 545 states have (on average 3.7963302752293577) internal successors, (2069), 545 states have internal predecessors, (2069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:49,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 2069 transitions. [2022-03-15 18:49:49,454 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 2069 transitions. Word has length 21 [2022-03-15 18:49:49,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:49:49,454 INFO L470 AbstractCegarLoop]: Abstraction has 546 states and 2069 transitions. [2022-03-15 18:49:49,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:49,454 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 2069 transitions. [2022-03-15 18:49:49,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:49:49,456 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:49:49,456 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 18:49:49,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 18:49:49,456 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 18:49:49,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:49:49,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1049782442, now seen corresponding path program 1 times [2022-03-15 18:49:49,457 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:49:49,458 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219480570] [2022-03-15 18:49:49,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:49:49,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:49:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:49:49,527 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 18:49:49,527 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:49:49,527 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219480570] [2022-03-15 18:49:49,528 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219480570] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:49:49,528 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:49:49,528 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 18:49:49,528 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1417219100] [2022-03-15 18:49:49,528 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:49:49,531 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:49:49,546 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 176 transitions. [2022-03-15 18:49:49,546 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:49:50,265 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [13674#(not (= ~count2~0 ~count1~0)), 13677#(or (= ~count3~0 ~count1~0) (not (= ~count3~0 ~count2~0))), 13675#(= ~count3~0 ~count1~0), 13676#(or (= ~count3~0 ~count1~0) (not (= ~count2~0 ~count1~0))), 13678#(or (not (= ~count3~0 ~count2~0)) (not (= ~count2~0 ~count1~0)))] [2022-03-15 18:49:50,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 18:49:50,265 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:49:50,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 18:49:50,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-03-15 18:49:50,266 INFO L87 Difference]: Start difference. First operand 546 states and 2069 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:50,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:49:50,489 INFO L93 Difference]: Finished difference Result 648 states and 2229 transitions. [2022-03-15 18:49:50,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 18:49:50,490 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:49:50,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:49:50,493 INFO L225 Difference]: With dead ends: 648 [2022-03-15 18:49:50,493 INFO L226 Difference]: Without dead ends: 588 [2022-03-15 18:49:50,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-03-15 18:49:50,494 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 118 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:49:50,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 14 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:49:50,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-03-15 18:49:50,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 526. [2022-03-15 18:49:50,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 3.6323809523809523) internal successors, (1907), 525 states have internal predecessors, (1907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:50,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 1907 transitions. [2022-03-15 18:49:50,507 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 1907 transitions. Word has length 22 [2022-03-15 18:49:50,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:49:50,509 INFO L470 AbstractCegarLoop]: Abstraction has 526 states and 1907 transitions. [2022-03-15 18:49:50,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:50,509 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 1907 transitions. [2022-03-15 18:49:50,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:49:50,510 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:49:50,510 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 18:49:50,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 18:49:50,511 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 18:49:50,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:49:50,511 INFO L85 PathProgramCache]: Analyzing trace with hash -617381989, now seen corresponding path program 1 times [2022-03-15 18:49:50,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:49:50,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614677824] [2022-03-15 18:49:50,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:49:50,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:49:50,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:49:50,589 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 18:49:50,590 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:49:50,590 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614677824] [2022-03-15 18:49:50,590 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614677824] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:49:50,590 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:49:50,590 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 18:49:50,590 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1087648581] [2022-03-15 18:49:50,590 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:49:50,593 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:49:50,609 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 176 transitions. [2022-03-15 18:49:50,610 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:49:51,383 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [15390#(not (= ~count3~0 ~count2~0)), 15391#(or (not (= ~count3~0 ~count2~0)) (not (= ~count3~0 ~count1~0))), 15393#(and (or (< ~count2~0 (+ ~count1~0 1)) (not (= ~count3~0 ~count1~0))) (or (<= ~count1~0 ~count2~0) (not (= ~count3~0 ~count1~0)))), 15389#(not (= ~count3~0 ~count1~0)), 15392#(or (not (= ~count3~0 ~count2~0)) (= ~count2~0 ~count1~0))] [2022-03-15 18:49:51,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 18:49:51,383 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:49:51,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 18:49:51,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-03-15 18:49:51,384 INFO L87 Difference]: Start difference. First operand 526 states and 1907 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:51,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:49:51,490 INFO L93 Difference]: Finished difference Result 526 states and 1879 transitions. [2022-03-15 18:49:51,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 18:49:51,490 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:49:51,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:49:51,493 INFO L225 Difference]: With dead ends: 526 [2022-03-15 18:49:51,493 INFO L226 Difference]: Without dead ends: 526 [2022-03-15 18:49:51,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-03-15 18:49:51,493 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 76 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:49:51,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 3 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:49:51,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-03-15 18:49:51,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2022-03-15 18:49:51,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 3.579047619047619) internal successors, (1879), 525 states have internal predecessors, (1879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:51,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 1879 transitions. [2022-03-15 18:49:51,506 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 1879 transitions. Word has length 22 [2022-03-15 18:49:51,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:49:51,506 INFO L470 AbstractCegarLoop]: Abstraction has 526 states and 1879 transitions. [2022-03-15 18:49:51,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:51,506 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 1879 transitions. [2022-03-15 18:49:51,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 18:49:51,508 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:49:51,508 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 18:49:51,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 18:49:51,508 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 18:49:51,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:49:51,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1462883916, now seen corresponding path program 1 times [2022-03-15 18:49:51,509 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:49:51,509 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396483470] [2022-03-15 18:49:51,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:49:51,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:49:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:49:51,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:49:51,657 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:49:51,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396483470] [2022-03-15 18:49:51,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396483470] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:49:51,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915238913] [2022-03-15 18:49:51,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:49:51,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:49:51,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:49:51,663 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 18:49:51,666 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 18:49:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:49:51,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 18:49:51,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:49:52,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:49:52,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:49:52,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:49:52,309 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915238913] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 18:49:52,309 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 18:49:52,309 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 4] total 13 [2022-03-15 18:49:52,309 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [330612257] [2022-03-15 18:49:52,310 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:49:52,313 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:49:52,378 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 247 transitions. [2022-03-15 18:49:52,378 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:49:55,593 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 18:49:55,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 18:49:55,594 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:49:55,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 18:49:55,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-03-15 18:49:55,594 INFO L87 Difference]: Start difference. First operand 526 states and 1879 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 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 18:49:55,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:49:55,835 INFO L93 Difference]: Finished difference Result 1264 states and 4421 transitions. [2022-03-15 18:49:55,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 18:49:55,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 18:49:55,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:49:55,841 INFO L225 Difference]: With dead ends: 1264 [2022-03-15 18:49:55,841 INFO L226 Difference]: Without dead ends: 1171 [2022-03-15 18:49:55,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 119 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2022-03-15 18:49:55,842 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 149 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:49:55,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 4 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:49:55,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2022-03-15 18:49:55,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 681. [2022-03-15 18:49:55,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 680 states have (on average 3.6176470588235294) internal successors, (2460), 680 states have internal predecessors, (2460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:55,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 2460 transitions. [2022-03-15 18:49:55,861 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 2460 transitions. Word has length 23 [2022-03-15 18:49:55,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:49:55,861 INFO L470 AbstractCegarLoop]: Abstraction has 681 states and 2460 transitions. [2022-03-15 18:49:55,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 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 18:49:55,861 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 2460 transitions. [2022-03-15 18:49:55,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 18:49:55,863 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:49:55,863 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 18:49:55,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 18:49:56,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:49:56,080 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 18:49:56,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:49:56,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1996414840, now seen corresponding path program 1 times [2022-03-15 18:49:56,081 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:49:56,081 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666100767] [2022-03-15 18:49:56,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:49:56,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:49:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:49:56,178 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 18:49:56,178 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:49:56,178 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666100767] [2022-03-15 18:49:56,178 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666100767] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:49:56,178 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128001670] [2022-03-15 18:49:56,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:49:56,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:49:56,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:49:56,184 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 18:49:56,185 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 18:49:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:49:56,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 18:49:56,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:49:56,384 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 18:49:56,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:49:56,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:49:56,474 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128001670] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 18:49:56,474 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 18:49:56,474 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2022-03-15 18:49:56,474 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [58250459] [2022-03-15 18:49:56,474 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:49:56,477 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:49:56,497 INFO L252 McrAutomatonBuilder]: Finished intersection with 111 states and 248 transitions. [2022-03-15 18:49:56,497 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:49:57,863 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 18:49:57,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 18:49:57,863 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:49:57,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 18:49:57,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-03-15 18:49:57,864 INFO L87 Difference]: Start difference. First operand 681 states and 2460 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:58,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:49:58,179 INFO L93 Difference]: Finished difference Result 1625 states and 5400 transitions. [2022-03-15 18:49:58,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 18:49:58,179 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 18:49:58,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:49:58,185 INFO L225 Difference]: With dead ends: 1625 [2022-03-15 18:49:58,186 INFO L226 Difference]: Without dead ends: 1625 [2022-03-15 18:49:58,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 123 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2022-03-15 18:49:58,186 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 97 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:49:58,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 0 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:49:58,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2022-03-15 18:49:58,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 755. [2022-03-15 18:49:58,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 754 states have (on average 3.590185676392573) internal successors, (2707), 754 states have internal predecessors, (2707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:58,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 2707 transitions. [2022-03-15 18:49:58,210 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 2707 transitions. Word has length 24 [2022-03-15 18:49:58,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:49:58,211 INFO L470 AbstractCegarLoop]: Abstraction has 755 states and 2707 transitions. [2022-03-15 18:49:58,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:49:58,211 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 2707 transitions. [2022-03-15 18:49:58,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 18:49:58,213 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:49:58,213 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 18:49:58,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 18:49:58,431 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,SelfDestructingSolverStorable9 [2022-03-15 18:49:58,431 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 18:49:58,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:49:58,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1870376370, now seen corresponding path program 1 times [2022-03-15 18:49:58,432 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:49:58,432 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565384937] [2022-03-15 18:49:58,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:49:58,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:49:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:49:58,481 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 18:49:58,481 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:49:58,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565384937] [2022-03-15 18:49:58,482 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565384937] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:49:58,482 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:49:58,482 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 18:49:58,482 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1053914183] [2022-03-15 18:49:58,482 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:49:58,486 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:49:58,533 INFO L252 McrAutomatonBuilder]: Finished intersection with 187 states and 463 transitions. [2022-03-15 18:49:58,533 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:50:00,378 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [23051#(<= ~n2~0 thread2Thread1of1ForFork2_~i~1)] [2022-03-15 18:50:00,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 18:50:00,378 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:50:00,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 18:50:00,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-15 18:50:00,379 INFO L87 Difference]: Start difference. First operand 755 states and 2707 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:00,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:50:00,488 INFO L93 Difference]: Finished difference Result 677 states and 2338 transitions. [2022-03-15 18:50:00,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 18:50:00,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 18:50:00,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:50:00,491 INFO L225 Difference]: With dead ends: 677 [2022-03-15 18:50:00,491 INFO L226 Difference]: Without dead ends: 555 [2022-03-15 18:50:00,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 161 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-15 18:50:00,491 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 21 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:50:00,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 7 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:50:00,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2022-03-15 18:50:00,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2022-03-15 18:50:00,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 554 states have (on average 3.583032490974729) internal successors, (1985), 554 states have internal predecessors, (1985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:00,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1985 transitions. [2022-03-15 18:50:00,503 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1985 transitions. Word has length 25 [2022-03-15 18:50:00,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:50:00,503 INFO L470 AbstractCegarLoop]: Abstraction has 555 states and 1985 transitions. [2022-03-15 18:50:00,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:00,504 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1985 transitions. [2022-03-15 18:50:00,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 18:50:00,505 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:50:00,505 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:50:00,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-15 18:50:00,505 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 18:50:00,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:50:00,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1700526256, now seen corresponding path program 1 times [2022-03-15 18:50:00,515 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:50:00,515 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44954086] [2022-03-15 18:50:00,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:50:00,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:50:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:50:00,575 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 18:50:00,575 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:50:00,576 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44954086] [2022-03-15 18:50:00,576 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44954086] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:50:00,576 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:50:00,576 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 18:50:00,576 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [749911463] [2022-03-15 18:50:00,576 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:50:00,581 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:50:00,600 INFO L252 McrAutomatonBuilder]: Finished intersection with 79 states and 142 transitions. [2022-03-15 18:50:00,600 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:50:01,183 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [24844#(<= ~n1~0 thread1Thread1of1ForFork1_~i~0)] [2022-03-15 18:50:01,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 18:50:01,183 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:50:01,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 18:50:01,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-15 18:50:01,183 INFO L87 Difference]: Start difference. First operand 555 states and 1985 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:01,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:50:01,305 INFO L93 Difference]: Finished difference Result 607 states and 2012 transitions. [2022-03-15 18:50:01,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 18:50:01,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 18:50:01,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:50:01,307 INFO L225 Difference]: With dead ends: 607 [2022-03-15 18:50:01,308 INFO L226 Difference]: Without dead ends: 401 [2022-03-15 18:50:01,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-15 18:50:01,308 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 95 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:50:01,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 3 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:50:01,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2022-03-15 18:50:01,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2022-03-15 18:50:01,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 400 states have (on average 3.515) internal successors, (1406), 400 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:01,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1406 transitions. [2022-03-15 18:50:01,317 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1406 transitions. Word has length 26 [2022-03-15 18:50:01,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:50:01,317 INFO L470 AbstractCegarLoop]: Abstraction has 401 states and 1406 transitions. [2022-03-15 18:50:01,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:01,318 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1406 transitions. [2022-03-15 18:50:01,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 18:50:01,319 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:50:01,319 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:50:01,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-15 18:50:01,320 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 18:50:01,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:50:01,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1355709534, now seen corresponding path program 1 times [2022-03-15 18:50:01,327 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:50:01,327 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701045245] [2022-03-15 18:50:01,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:50:01,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:50:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:50:01,447 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 18:50:01,447 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:50:01,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701045245] [2022-03-15 18:50:01,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701045245] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:50:01,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038169111] [2022-03-15 18:50:01,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:50:01,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:50:01,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:50:01,449 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 18:50:01,458 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 18:50:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:50:01,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 18:50:01,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:50:01,713 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 18:50:01,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:50:01,854 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 18:50:01,854 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038169111] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:50:01,854 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:50:01,854 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 15 [2022-03-15 18:50:01,855 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1006089099] [2022-03-15 18:50:01,855 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:50:01,859 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:50:01,887 INFO L252 McrAutomatonBuilder]: Finished intersection with 97 states and 198 transitions. [2022-03-15 18:50:01,887 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:50:03,710 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [26391#(and (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), 26425#(and (<= ~n1~0 ~n2~0) (or (= (+ ~res1~0 ~n2~0) ~n1~0) (= ~res1~0 0)))] [2022-03-15 18:50:03,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 18:50:03,711 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:50:03,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 18:50:03,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2022-03-15 18:50:03,712 INFO L87 Difference]: Start difference. First operand 401 states and 1406 transitions. Second operand has 11 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:03,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:50:03,942 INFO L93 Difference]: Finished difference Result 1102 states and 3958 transitions. [2022-03-15 18:50:03,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 18:50:03,943 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 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 18:50:03,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:50:03,949 INFO L225 Difference]: With dead ends: 1102 [2022-03-15 18:50:03,949 INFO L226 Difference]: Without dead ends: 1009 [2022-03-15 18:50:03,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2022-03-15 18:50:03,950 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 210 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:50:03,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 6 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:50:03,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2022-03-15 18:50:03,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 556. [2022-03-15 18:50:03,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 555 states have (on average 3.5783783783783782) internal successors, (1986), 555 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:03,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 1986 transitions. [2022-03-15 18:50:03,968 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 1986 transitions. Word has length 26 [2022-03-15 18:50:03,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:50:03,969 INFO L470 AbstractCegarLoop]: Abstraction has 556 states and 1986 transitions. [2022-03-15 18:50:03,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:03,969 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 1986 transitions. [2022-03-15 18:50:03,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 18:50:03,971 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:50:03,971 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:50:03,994 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 18:50:04,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:50:04,194 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 18:50:04,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:50:04,195 INFO L85 PathProgramCache]: Analyzing trace with hash -823413516, now seen corresponding path program 1 times [2022-03-15 18:50:04,196 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:50:04,196 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300440841] [2022-03-15 18:50:04,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:50:04,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:50:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:50:04,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:50:04,362 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:50:04,362 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300440841] [2022-03-15 18:50:04,362 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300440841] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:50:04,362 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503675073] [2022-03-15 18:50:04,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:50:04,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:50:04,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:50:04,364 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 18:50:04,365 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 18:50:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:50:04,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 18:50:04,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:50:04,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:50:04,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:50:04,778 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:50:04,778 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 119 treesize of output 123 [2022-03-15 18:50:05,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:50:05,106 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503675073] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 18:50:05,106 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 18:50:05,106 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6, 8] total 20 [2022-03-15 18:50:05,106 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1827695439] [2022-03-15 18:50:05,106 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:50:05,111 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:50:05,132 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 143 transitions. [2022-03-15 18:50:05,132 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:50:05,350 INFO L353 Elim1Store]: treesize reduction 12, result has 36.8 percent of original size [2022-03-15 18:50:05,350 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 19 treesize of output 11 [2022-03-15 18:50:05,719 INFO L353 Elim1Store]: treesize reduction 12, result has 36.8 percent of original size [2022-03-15 18:50:05,719 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 19 treesize of output 11 [2022-03-15 18:50:06,007 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:06,045 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:06,781 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:07,117 INFO L353 Elim1Store]: treesize reduction 12, result has 36.8 percent of original size [2022-03-15 18:50:07,118 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 19 treesize of output 11 [2022-03-15 18:50:07,607 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:07,660 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:07,888 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-03-15 18:50:09,299 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [28653#(<= 1 ~res3~0), 28828#(and (or (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (<= ~n3~0 thread3Thread1of1ForFork0_~i~2)) (or (<= ~res2~0 0) (< ~n3~0 ~n1~0)) (or (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (< ~n3~0 ~n1~0)) (or (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (<= ~res2~0 0)) (or (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (or (<= ~res2~0 0) (<= ~n3~0 thread3Thread1of1ForFork0_~i~2))), 28824#(and (or (< 0 ~res3~0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0))) (or (< 0 ~res3~0) (<= ~res2~0 0))), 28825#(and (or (<= ~res2~0 0) (<= ~n3~0 thread3Thread1of1ForFork0_~i~2) (<= ~n1~0 thread3Thread1of1ForFork0_~i~2)) (or (< 0 ~res3~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (<= ~res2~0 0)) (or (<= ~res2~0 0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (< ~n3~0 ~n1~0))), 28826#(and (or (<= ~res2~0 0) (<= ~n3~0 thread3Thread1of1ForFork0_~i~2) (<= ~n1~0 thread3Thread1of1ForFork0_~i~2)) (or (< 0 ~res3~0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (or (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (< ~n3~0 ~n1~0)) (or (< 0 ~res3~0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (<= ~res2~0 0)) (or (<= ~res2~0 0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (< ~n3~0 ~n1~0)) (or (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)) (<= ~n3~0 thread3Thread1of1ForFork0_~i~2) (<= ~n1~0 thread3Thread1of1ForFork0_~i~2))), 28829#(and (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (<= ~n3~0 thread3Thread1of1ForFork0_~i~2) (<= (+ ~n3~0 1) ~n1~0)), 28827#(and (or (<= ~n3~0 thread3Thread1of1ForFork0_~i~2) (<= ~n1~0 thread3Thread1of1ForFork0_~i~2)) (or (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (<= 1 ~res3~0)) (or (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (<= (+ ~n3~0 1) ~n1~0)))] [2022-03-15 18:50:09,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 18:50:09,300 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:50:09,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 18:50:09,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2022-03-15 18:50:09,300 INFO L87 Difference]: Start difference. First operand 556 states and 1986 transitions. Second operand has 17 states, 16 states have (on average 5.3125) internal successors, (85), 16 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:09,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:50:09,870 INFO L93 Difference]: Finished difference Result 1103 states and 3825 transitions. [2022-03-15 18:50:09,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 18:50:09,870 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.3125) internal successors, (85), 16 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 18:50:09,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:50:09,874 INFO L225 Difference]: With dead ends: 1103 [2022-03-15 18:50:09,874 INFO L226 Difference]: Without dead ends: 558 [2022-03-15 18:50:09,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 57 SyntacticMatches, 28 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=324, Invalid=1008, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 18:50:09,875 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 501 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:50:09,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [501 Valid, 17 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:50:09,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2022-03-15 18:50:09,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2022-03-15 18:50:09,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 557 states have (on average 3.569120287253142) internal successors, (1988), 557 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:09,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 1988 transitions. [2022-03-15 18:50:09,886 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 1988 transitions. Word has length 27 [2022-03-15 18:50:09,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:50:09,886 INFO L470 AbstractCegarLoop]: Abstraction has 558 states and 1988 transitions. [2022-03-15 18:50:09,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.3125) internal successors, (85), 16 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:09,886 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 1988 transitions. [2022-03-15 18:50:09,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 18:50:09,888 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:50:09,888 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:50:09,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 18:50:10,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:50:10,110 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 18:50:10,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:50:10,111 INFO L85 PathProgramCache]: Analyzing trace with hash 2071956446, now seen corresponding path program 1 times [2022-03-15 18:50:10,112 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:50:10,112 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755743836] [2022-03-15 18:50:10,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:50:10,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:50:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:50:10,217 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 18:50:10,218 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:50:10,218 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755743836] [2022-03-15 18:50:10,218 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755743836] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:50:10,218 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556193319] [2022-03-15 18:50:10,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:50:10,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:50:10,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:50:10,219 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 18:50:10,220 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 18:50:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:50:10,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 18:50:10,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:50:10,429 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 18:50:10,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:50:10,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 18:50:10,548 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556193319] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 18:50:10,548 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 18:50:10,548 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 15 [2022-03-15 18:50:10,548 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1634249669] [2022-03-15 18:50:10,548 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:50:10,552 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:50:10,582 INFO L252 McrAutomatonBuilder]: Finished intersection with 81 states and 144 transitions. [2022-03-15 18:50:10,582 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:50:11,205 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 18:50:11,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 18:50:11,206 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:50:11,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 18:50:11,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-03-15 18:50:11,206 INFO L87 Difference]: Start difference. First operand 558 states and 1988 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:11,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:50:11,310 INFO L93 Difference]: Finished difference Result 738 states and 2524 transitions. [2022-03-15 18:50:11,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 18:50:11,311 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 18:50:11,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:50:11,314 INFO L225 Difference]: With dead ends: 738 [2022-03-15 18:50:11,314 INFO L226 Difference]: Without dead ends: 738 [2022-03-15 18:50:11,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 96 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-03-15 18:50:11,315 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 87 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:50:11,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 3 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:50:11,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2022-03-15 18:50:11,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 644. [2022-03-15 18:50:11,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 643 states have (on average 3.5645412130637637) internal successors, (2292), 643 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:11,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 2292 transitions. [2022-03-15 18:50:11,330 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 2292 transitions. Word has length 28 [2022-03-15 18:50:11,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:50:11,330 INFO L470 AbstractCegarLoop]: Abstraction has 644 states and 2292 transitions. [2022-03-15 18:50:11,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:11,330 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 2292 transitions. [2022-03-15 18:50:11,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 18:50:11,332 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:50:11,332 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:50:11,355 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 18:50:11,547 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,SelfDestructingSolverStorable14 [2022-03-15 18:50:11,547 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 18:50:11,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:50:11,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1290476078, now seen corresponding path program 1 times [2022-03-15 18:50:11,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:50:11,548 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854368230] [2022-03-15 18:50:11,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:50:11,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:50:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:50:11,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 18:50:11,641 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:50:11,641 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854368230] [2022-03-15 18:50:11,641 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854368230] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:50:11,642 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175213236] [2022-03-15 18:50:11,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:50:11,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:50:11,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:50:11,643 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 18:50:11,643 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 18:50:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:50:11,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 18:50:11,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:50:11,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 18:50:11,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:50:12,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 18:50:12,121 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175213236] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:50:12,121 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:50:12,121 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 15 [2022-03-15 18:50:12,121 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [197401917] [2022-03-15 18:50:12,121 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:50:12,125 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:50:12,164 INFO L252 McrAutomatonBuilder]: Finished intersection with 101 states and 194 transitions. [2022-03-15 18:50:12,164 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:50:14,124 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [33465#(and (or (<= ~n2~0 ~n3~0) (not (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0))) (or (<= ~res2~0 0) (= (mod thread2Thread1of1ForFork2_~stop~1 256) 0)))] [2022-03-15 18:50:14,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 18:50:14,125 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:50:14,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 18:50:14,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-03-15 18:50:14,125 INFO L87 Difference]: Start difference. First operand 644 states and 2292 transitions. Second operand has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:14,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:50:14,321 INFO L93 Difference]: Finished difference Result 1375 states and 4807 transitions. [2022-03-15 18:50:14,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 18:50:14,322 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 18:50:14,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:50:14,328 INFO L225 Difference]: With dead ends: 1375 [2022-03-15 18:50:14,328 INFO L226 Difference]: Without dead ends: 1282 [2022-03-15 18:50:14,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2022-03-15 18:50:14,329 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 84 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:50:14,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 12 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:50:14,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2022-03-15 18:50:14,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 930. [2022-03-15 18:50:14,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 929 states have (on average 3.6017222820236814) internal successors, (3346), 929 states have internal predecessors, (3346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:14,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 3346 transitions. [2022-03-15 18:50:14,351 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 3346 transitions. Word has length 30 [2022-03-15 18:50:14,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:50:14,351 INFO L470 AbstractCegarLoop]: Abstraction has 930 states and 3346 transitions. [2022-03-15 18:50:14,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:14,351 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 3346 transitions. [2022-03-15 18:50:14,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 18:50:14,354 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:50:14,354 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:50:14,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 18:50:14,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 18:50:14,568 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 18:50:14,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:50:14,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1080847525, now seen corresponding path program 2 times [2022-03-15 18:50:14,569 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:50:14,569 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392815281] [2022-03-15 18:50:14,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:50:14,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:50:14,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:50:15,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:50:15,275 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:50:15,275 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392815281] [2022-03-15 18:50:15,275 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392815281] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:50:15,275 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608071620] [2022-03-15 18:50:15,275 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 18:50:15,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:50:15,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:50:15,277 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 18:50:15,280 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 18:50:15,387 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:50:15,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:50:15,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 44 conjunts are in the unsatisfiable core [2022-03-15 18:50:15,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:50:15,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:50:15,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:50:15,886 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-15 18:50:15,886 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 40 treesize of output 41 [2022-03-15 18:50:16,352 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-03-15 18:50:16,352 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 89 treesize of output 57 [2022-03-15 18:50:16,477 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 18:50:16,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:50:16,960 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~res1~0 0) (forall ((~get3~0.base Int) (v_ArrVal_653 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_653))) (let ((.cse0 (select (select .cse1 ~get3~0.base) c_~get3~0.offset))) (or (and (< 0 c_~n1~0) (<= .cse0 (select (select .cse1 c_~get1~0.base) c_~get1~0.offset))) (< (select (select .cse1 c_~get2~0.base) c_~get2~0.offset) .cse0)))))) is different from false [2022-03-15 18:50:17,306 INFO L353 Elim1Store]: treesize reduction 27, result has 80.3 percent of original size [2022-03-15 18:50:17,306 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 174 treesize of output 219 [2022-03-15 18:50:17,337 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:50:17,337 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 112 [2022-03-15 18:50:30,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 18:50:30,477 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608071620] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:50:30,477 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:50:30,477 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 14] total 47 [2022-03-15 18:50:30,477 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1661457270] [2022-03-15 18:50:30,477 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:50:30,483 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:50:30,512 INFO L252 McrAutomatonBuilder]: Finished intersection with 102 states and 195 transitions. [2022-03-15 18:50:30,512 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:50:38,715 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [36945#(and (or (not (= (select (select |#memory_int| ~get2~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get2~0.offset)) (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (< thread3Thread1of1ForFork0_~i~2 ~n1~0) (<= (+ ~res1~0 1) 0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (= ~res3~0 1) (<= ~n3~0 thread2Thread1of1ForFork2_~i~1)) (or (not (= (select (select |#memory_int| ~get2~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get2~0.offset)) (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (< thread3Thread1of1ForFork0_~i~2 ~n3~0) (<= (+ ~res1~0 1) 0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (= (+ (* (- 1) ~n3~0) ~n1~0) 1) (<= ~n3~0 thread2Thread1of1ForFork2_~i~1)) (or (not (= (select (select |#memory_int| ~get2~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get2~0.offset)) (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (< thread3Thread1of1ForFork0_~i~2 ~n3~0) (<= (+ ~res1~0 1) 0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (= ~res3~0 1) (<= ~n3~0 thread2Thread1of1ForFork2_~i~1)) (or (not (= (select (select |#memory_int| ~get2~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get2~0.offset)) (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (<= (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (<= (+ ~res1~0 1) 0) (<= ~n3~0 thread3Thread1of1ForFork0_~i~2) (<= ~n1~0 thread3Thread1of1ForFork0_~i~2)) (or (not (= (select (select |#memory_int| ~get2~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get2~0.offset)) (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (< thread3Thread1of1ForFork0_~i~2 ~n1~0) (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (<= (+ ~res1~0 1) 0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (= (+ (* (- 1) ~n3~0) ~n1~0) 1))), 36947#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= ~get2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 1 ~n3~0) (= ~get3~0.offset 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~get2~0.offset 0) (or (<= (select (select |#memory_int| ~get2~0.base) 0) (select (select |#memory_int| ~get1~0.base) 0)) (< |thread1Thread1of1ForFork1_#t~mem4| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))), 36940#(or (not (= (select (select |#memory_int| ~get2~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get2~0.offset)) (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (<= (+ ~res1~0 1) 0) (= ~res3~0 1) (<= ~n3~0 thread2Thread1of1ForFork2_~i~1)), 36949#(and (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (not (= ~get2~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (= ~get3~0.offset 0)) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (= ~get1~0.offset 0)) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (<= (select (select |#memory_int| ~get2~0.base) 0) (select (select |#memory_int| ~get1~0.base) 0)) (< (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (<= 1 ~n1~0)) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (= ~get2~0.offset 0)) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (<= 1 ~n3~0))), 36942#(and (or (< thread3Thread1of1ForFork0_~i~2 ~n1~0) (not (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (<= (+ ~res1~0 1) 0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (= (+ (* (- 1) ~n3~0) ~n1~0) 1)) (or (< thread3Thread1of1ForFork0_~i~2 ~n1~0) (not (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (<= (+ ~res1~0 1) 0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (= ~res3~0 1)) (or (< thread3Thread1of1ForFork0_~i~2 ~n3~0) (not (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (<= (+ ~res1~0 1) 0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (= ~res3~0 1)) (or (<= (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (not (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (<= (+ ~res1~0 1) 0) (<= ~n3~0 thread3Thread1of1ForFork0_~i~2) (<= ~n1~0 thread3Thread1of1ForFork0_~i~2)) (or (< thread3Thread1of1ForFork0_~i~2 ~n3~0) (not (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (<= (+ ~res1~0 1) 0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (= (+ (* (- 1) ~n3~0) ~n1~0) 1))), 36943#(and (or (<= (+ ~res1~0 1) 0) (<= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get1~0.base) ~get1~0.offset)) (<= ~n3~0 0)) (or (< 0 ~n1~0) (<= (+ ~res1~0 1) 0) (= (+ (* (- 1) ~n3~0) ~n1~0) 1)) (or (< 0 ~n3~0) (<= (+ ~res1~0 1) 0) (= (+ ~n3~0 1) ~n1~0))), 36952#(and (or (< thread3Thread1of1ForFork0_~i~2 ~n1~0) (not (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (<= (+ ~res1~0 1) 0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (<= ~n3~0 0) (= (+ (* (- 1) ~n3~0) ~n1~0) 1)) (or (<= (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (not (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (<= (+ ~res1~0 1) 0) (<= ~n3~0 thread3Thread1of1ForFork0_~i~2) (<= ~n3~0 0) (<= ~n1~0 thread3Thread1of1ForFork0_~i~2)) (or (< thread3Thread1of1ForFork0_~i~2 ~n3~0) (not (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (<= (+ ~res1~0 1) 0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (<= ~n3~0 0) (= ~res3~0 1)) (or (< thread3Thread1of1ForFork0_~i~2 ~n3~0) (not (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (<= (+ ~res1~0 1) 0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (<= ~n3~0 0) (= (+ (* (- 1) ~n3~0) ~n1~0) 1)) (or (< thread3Thread1of1ForFork0_~i~2 ~n1~0) (not (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (<= (+ ~res1~0 1) 0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (<= ~n3~0 0) (= ~res3~0 1))), 36950#(and (or (<= ~n1~0 0) (= ~get2~0.offset 0)) (or (not (= ~get2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 0)) (or (<= 1 ~n3~0) (<= ~n1~0 0)) (or (<= ~n1~0 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (= ~get1~0.offset 0) (<= ~n1~0 0)) (or (<= ~n1~0 0) (= ~get3~0.offset 0))), 36946#(and (or (not (= (select (select |#memory_int| ~get2~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get2~0.offset)) (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (< 0 ~n1~0) (<= (+ ~res1~0 1) 0) (= (+ (* (- 1) ~n3~0) ~n1~0) 1)) (or (not (= (select (select |#memory_int| ~get2~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get2~0.offset)) (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (< 0 ~n3~0) (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (<= (+ ~res1~0 1) 0) (= (+ ~n3~0 1) ~n1~0)) (or (not (= (select (select |#memory_int| ~get2~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get2~0.offset)) (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (<= (+ ~res1~0 1) 0) (<= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get1~0.base) ~get1~0.offset)) (<= ~n3~0 0) (<= ~n3~0 thread2Thread1of1ForFork2_~i~1))), 36956#(and (or (not (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= thread3Thread1of1ForFork0_~i~2 0) (not (< 0 ~n3~0))) (or (<= (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (not (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (<= (+ ~res1~0 1) 0) (<= ~n3~0 0)) (or (not (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (= ~get3~0.offset 0) (not (< 0 ~n3~0))) (or (<= 1 ~n1~0) (not (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (not (< 0 ~n3~0))) (or (= ~get1~0.offset 0) (not (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (not (< 0 ~n3~0))) (or (= thread3Thread1of1ForFork0_~stop~2 0) (not (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (not (< 0 ~n3~0)))), 36939#(or (not (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (<= (+ ~res1~0 1) 0) (= ~res3~0 1)), 36951#(or (not (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (<= (+ ~res1~0 1) 0) (<= ~n3~0 0) (= ~res3~0 1)), 36944#(and (or (not (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (<= (+ ~res1~0 1) 0) (<= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get1~0.base) ~get1~0.offset)) (<= ~n3~0 0)) (or (< 0 ~n1~0) (not (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (<= (+ ~res1~0 1) 0) (= (+ (* (- 1) ~n3~0) ~n1~0) 1)) (or (< 0 ~n3~0) (not (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (<= (+ ~res1~0 1) 0) (= (+ ~n3~0 1) ~n1~0))), 36941#(and (or (< thread3Thread1of1ForFork0_~i~2 ~n1~0) (<= (+ ~res1~0 1) 0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (= (+ (* (- 1) ~n3~0) ~n1~0) 1)) (or (< thread3Thread1of1ForFork0_~i~2 ~n3~0) (<= (+ ~res1~0 1) 0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (= ~res3~0 1)) (or (<= (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (<= (+ ~res1~0 1) 0) (<= ~n3~0 thread3Thread1of1ForFork0_~i~2) (<= ~n1~0 thread3Thread1of1ForFork0_~i~2)) (or (< thread3Thread1of1ForFork0_~i~2 ~n3~0) (<= (+ ~res1~0 1) 0) (not (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0)) (= (+ (* (- 1) ~n3~0) ~n1~0) 1)) (or (< thread3Thread1of1ForFork0_~i~2 ~n1~0) (<= (+ ~res1~0 1) 0) (= (mod thread3Thread1of1ForFork0_~stop~2 256) 0) (= ~res3~0 1))), 36954#(and (or (not (= (select (select |#memory_int| ~get2~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get2~0.offset)) (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= ~get3~0.offset 0)) (or (not (= (select (select |#memory_int| ~get2~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get2~0.offset)) (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (<= 1 ~n3~0)) (or (not (= (select (select |#memory_int| ~get2~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get2~0.offset)) (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)) (= thread3Thread1of1ForFork0_~i~2 0)) (or (= ~get1~0.offset 0) (not (= (select (select |#memory_int| ~get2~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get2~0.offset)) (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0))) (or (not (= (select (select |#memory_int| ~get2~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get2~0.offset)) (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (<= (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (<= (+ ~res1~0 1) 0) (<= ~n3~0 thread2Thread1of1ForFork2_~i~1)) (or (= thread3Thread1of1ForFork0_~stop~2 0) (not (= (select (select |#memory_int| ~get2~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get2~0.offset)) (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0))) (or (<= 1 ~n1~0) (not (= (select (select |#memory_int| ~get2~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get2~0.offset)) (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (not (< thread2Thread1of1ForFork2_~i~1 ~n3~0)))), 36953#(and (or (not (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (= thread3Thread1of1ForFork0_~i~2 0)) (or (not (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (<= 1 ~n3~0)) (or (not (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (= ~get3~0.offset 0)) (or (<= (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (not (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))) (<= (+ ~res1~0 1) 0)) (or (= ~get1~0.offset 0) (not (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset))))) (or (= thread3Thread1of1ForFork0_~stop~2 0) (not (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset))))) (or (<= 1 ~n1~0) (not (= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get3~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get3~0.offset)))))), 36948#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (not (= ~get2~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 1 ~n3~0) (= ~get3~0.offset 0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~get2~0.offset 0) (or (<= (select (select |#memory_int| ~get2~0.base) 0) (select (select |#memory_int| ~get1~0.base) 0)) (< (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))), 36955#(and (or (not (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (<= (+ ~res1~0 1) 0) (<= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get1~0.base) ~get1~0.offset)) (<= ~n3~0 0)) (or (< 0 ~n1~0) (not (= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (<= (+ ~res1~0 1) 0) (<= ~n3~0 0)))] [2022-03-15 18:50:38,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 18:50:38,716 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:50:38,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 18:50:38,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=4005, Unknown=1, NotChecked=128, Total=4422 [2022-03-15 18:50:38,717 INFO L87 Difference]: Start difference. First operand 930 states and 3346 transitions. Second operand has 38 states, 37 states have (on average 3.027027027027027) internal successors, (112), 37 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:45,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:50:45,655 INFO L93 Difference]: Finished difference Result 4296 states and 14558 transitions. [2022-03-15 18:50:45,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-15 18:50:45,655 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 3.027027027027027) internal successors, (112), 37 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 18:50:45,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:50:45,671 INFO L225 Difference]: With dead ends: 4296 [2022-03-15 18:50:45,671 INFO L226 Difference]: Without dead ends: 4234 [2022-03-15 18:50:45,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 78 SyntacticMatches, 4 SemanticMatches, 111 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2833 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=1749, Invalid=10686, Unknown=1, NotChecked=220, Total=12656 [2022-03-15 18:50:45,674 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1317 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 2759 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 2759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 18:50:45,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1317 Valid, 0 Invalid, 2920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 2759 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 18:50:45,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2022-03-15 18:50:45,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 1129. [2022-03-15 18:50:45,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 1128 states have (on average 3.504432624113475) internal successors, (3953), 1128 states have internal predecessors, (3953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:45,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 3953 transitions. [2022-03-15 18:50:45,738 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 3953 transitions. Word has length 31 [2022-03-15 18:50:45,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:50:45,739 INFO L470 AbstractCegarLoop]: Abstraction has 1129 states and 3953 transitions. [2022-03-15 18:50:45,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 3.027027027027027) internal successors, (112), 37 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:50:45,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 3953 transitions. [2022-03-15 18:50:45,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 18:50:45,742 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:50:45,742 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:50:45,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-03-15 18:50:45,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:50:45,955 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:50:45,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:50:45,956 INFO L85 PathProgramCache]: Analyzing trace with hash -801177509, now seen corresponding path program 3 times [2022-03-15 18:50:45,957 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:50:45,957 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168176400] [2022-03-15 18:50:45,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:50:45,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:50:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:50:46,473 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 18:50:46,473 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:50:46,474 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168176400] [2022-03-15 18:50:46,474 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168176400] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:50:46,474 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590411312] [2022-03-15 18:50:46,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:50:46,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:50:46,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:50:46,475 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 18:50:46,475 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 18:50:46,595 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 18:50:46,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:50:46,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 44 conjunts are in the unsatisfiable core [2022-03-15 18:50:46,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:50:47,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:50:47,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:50:47,333 INFO L353 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-03-15 18:50:47,333 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 57 [2022-03-15 18:50:47,341 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 39 treesize of output 33 [2022-03-15 18:50:47,481 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 18:50:47,481 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 66 treesize of output 38 [2022-03-15 18:50:47,577 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 18:50:47,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:50:50,341 INFO L353 Elim1Store]: treesize reduction 27, result has 80.3 percent of original size [2022-03-15 18:50:50,342 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 120 treesize of output 173 [2022-03-15 18:50:50,366 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:50:50,366 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 54 treesize of output 55 [2022-03-15 18:50:51,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 18:50:51,514 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590411312] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:50:51,514 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:50:51,515 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2022-03-15 18:50:51,515 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [881446243] [2022-03-15 18:50:51,515 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:50:51,520 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:50:51,555 INFO L252 McrAutomatonBuilder]: Finished intersection with 81 states and 135 transitions. [2022-03-15 18:50:51,556 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:50:58,381 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [43833#(and (or (<= 1 ~n3~0) (<= ~n1~0 0)) (or (<= (select (select |#memory_int| ~get3~0.base) 0) (select (select |#memory_int| ~get1~0.base) 0)) (<= ~n1~0 0) (< (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (or (<= ~n1~0 0) (< (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (<= ~n1~0 0) (< (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (= ~get1~0.offset 0) (<= ~n1~0 0)) (or (<= ~n1~0 0) (= ~get3~0.offset 0))), 43832#(and (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (= ~get3~0.offset 0)) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (= ~get1~0.offset 0)) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (<= 1 ~n1~0)) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (<= (select (select |#memory_int| ~get3~0.base) 0) (select (select |#memory_int| ~get1~0.base) 0)) (< (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (<= 1 ~n3~0))), 43845#(and (or (<= (+ ~res1~0 1) 0) (<= (select (select |#memory_int| ~get3~0.base) ~get3~0.offset) (select (select |#memory_int| ~get1~0.base) ~get1~0.offset)) (<= ~n3~0 0)) (or (< 0 ~n1~0) (<= (+ ~res1~0 1) 0) (= (+ ~n3~0 1) ~n1~0)) (or (< 0 ~n3~0) (<= (+ ~res1~0 1) 0) (= ~res3~0 1)) (or (< 0 ~n3~0) (<= (+ ~res1~0 1) 0) (= (+ ~n3~0 1) ~n1~0))), 43847#(and (or (<= ~n1~0 0) (= ~get2~0.offset 0)) (or (<= 1 ~n3~0) (<= ~n1~0 0)) (or (<= ~n1~0 0) (< (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (<= ~n1~0 0) (< (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (= ~get1~0.offset 0) (<= ~n1~0 0)) (or (<= ~n1~0 0) (= ~get3~0.offset 0))), 43844#(and (or (< thread3Thread1of1ForFork0_~i~2 ~n1~0) (<= (+ ~res1~0 1) 0) (= (+ ~n3~0 1) ~n1~0)) (or (< thread3Thread1of1ForFork0_~i~2 ~n3~0) (<= (+ ~res1~0 1) 0) (= (+ ~n3~0 1) ~n1~0)) (or (<= (select (select |#memory_int| ~get3~0.base) (+ ~get3~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread3Thread1of1ForFork0_~i~2 4)))) (<= (+ ~res1~0 1) 0) (<= ~n3~0 thread3Thread1of1ForFork0_~i~2)) (or (< thread3Thread1of1ForFork0_~i~2 ~n3~0) (<= (+ ~res1~0 1) 0) (= ~res3~0 1))), 43838#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (or (< |thread1Thread1of1ForFork1_#t~mem4| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (<= 1 ~n3~0) (or (< |thread1Thread1of1ForFork1_#t~mem4| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (or (< |thread1Thread1of1ForFork1_#t~mem4| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= (select (select |#memory_int| ~get2~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get2~0.offset)) (select (select |#memory_int| ~get1~0.base) 0))) (= thread2Thread1of1ForFork2_~i~1 0)), 43830#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (or (< |thread1Thread1of1ForFork1_#t~mem4| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (<= (select (select |#memory_int| ~get3~0.base) 0) (select (select |#memory_int| ~get1~0.base) 0)) (< |thread1Thread1of1ForFork1_#t~mem4| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (<= 1 ~n3~0) (or (< |thread1Thread1of1ForFork1_#t~mem4| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (= ~get3~0.offset 0)), 43837#(and (or (<= 1 ~n3~0) (<= ~n1~0 0)) (or (<= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get1~0.base) 0)) (<= ~n1~0 0) (< (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset))) (or (<= ~n1~0 0) (= thread2Thread1of1ForFork2_~i~1 0)) (or (<= ~n1~0 0) (< (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (<= ~n1~0 0) (< (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (= ~get1~0.offset 0) (<= ~n1~0 0)) (or (<= ~n1~0 0) (= ~get3~0.offset 0))), 43834#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (or (< |thread1Thread1of1ForFork1_#t~mem4| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (<= 1 ~n3~0) (or (< |thread1Thread1of1ForFork1_#t~mem4| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (< |thread1Thread1of1ForFork1_#t~mem4| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get1~0.base) 0))) (= ~get3~0.offset 0) (= thread2Thread1of1ForFork2_~i~1 0)), 43840#(and (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (= ~get3~0.offset 0)) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (= ~get1~0.offset 0)) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (<= (select (select |#memory_int| ~get2~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get2~0.offset)) (select (select |#memory_int| ~get1~0.base) 0)) (< (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (<= 1 ~n1~0)) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (= ~get2~0.offset 0)) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (= thread2Thread1of1ForFork2_~i~1 0)) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (<= 1 ~n3~0))), 43841#(and (or (<= ~n1~0 0) (= ~get2~0.offset 0)) (or (<= 1 ~n3~0) (<= ~n1~0 0)) (or (<= ~n1~0 0) (= thread2Thread1of1ForFork2_~i~1 0)) (or (<= ~n1~0 0) (< (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (<= ~n1~0 0) (< (select (select |#memory_int| ~get1~0.base) ~get1~0.offset) (select (select |#memory_int| ~get2~0.base) ~get2~0.offset)) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (or (= ~get1~0.offset 0) (<= ~n1~0 0)) (or (<= ~n1~0 0) (= ~get3~0.offset 0))), 43839#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (or (<= (select (select |#memory_int| ~get2~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get2~0.offset)) (select (select |#memory_int| ~get1~0.base) 0)) (< (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (<= 1 ~n3~0) (or (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (or (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread2Thread1of1ForFork2_~i~1 0)), 43846#(and (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (<= (select (select |#memory_int| ~get2~0.base) ~get2~0.offset) (select (select |#memory_int| ~get1~0.base) 0)) (< (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (= ~get3~0.offset 0)) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (= ~get1~0.offset 0)) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (<= 1 ~n1~0)) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (= ~get2~0.offset 0)) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (<= 1 ~n3~0))), 43835#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (or (<= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get1~0.base) 0)) (< (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= ~get3~0.offset 0) (or (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= thread2Thread1of1ForFork2_~i~1 0)), 43843#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (or (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (or (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (<= (select (select |#memory_int| ~get2~0.base) ~get2~0.offset) (select (select |#memory_int| ~get1~0.base) 0)) (< (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))), 43836#(and (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (<= |thread2Thread1of1ForFork2_#t~mem9| (select (select |#memory_int| ~get1~0.base) 0)) (< (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (= ~get3~0.offset 0)) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (= ~get1~0.offset 0)) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (<= 1 ~n1~0)) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (= thread2Thread1of1ForFork2_~i~1 0)) (or (<= ~n1~0 thread1Thread1of1ForFork1_~i~0) (<= 1 ~n3~0))), 43831#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (<= 1 ~n3~0) (or (<= (select (select |#memory_int| ~get3~0.base) 0) (select (select |#memory_int| ~get1~0.base) 0)) (< (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (= ~get3~0.offset 0) (or (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (< (select (select |#memory_int| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))))), 43842#(and (= ~get1~0.offset 0) (<= 1 ~n1~0) (or (< |thread1Thread1of1ForFork1_#t~mem4| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (not (= ~get3~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (<= 1 ~n3~0) (or (< |thread1Thread1of1ForFork1_#t~mem4| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (not (= ~get1~0.base |ULTIMATE.start_main_~#t3~0#1.base|))) (= ~get3~0.offset 0) (= ~get2~0.offset 0) (or (<= (select (select |#memory_int| ~get2~0.base) 0) (select (select |#memory_int| ~get1~0.base) 0)) (< |thread1Thread1of1ForFork1_#t~mem4| (select (select |#memory_int| ~get2~0.base) (+ ~get2~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))] [2022-03-15 18:50:58,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 18:50:58,382 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:50:58,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 18:50:58,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=3880, Unknown=35, NotChecked=0, Total=4160 [2022-03-15 18:50:58,384 INFO L87 Difference]: Start difference. First operand 1129 states and 3953 transitions. Second operand has 35 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:04,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:51:04,047 INFO L93 Difference]: Finished difference Result 4828 states and 17100 transitions. [2022-03-15 18:51:04,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 18:51:04,047 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 18:51:04,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:51:04,069 INFO L225 Difference]: With dead ends: 4828 [2022-03-15 18:51:04,069 INFO L226 Difference]: Without dead ends: 4766 [2022-03-15 18:51:04,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 54 SyntacticMatches, 7 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2088 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1014, Invalid=7881, Unknown=35, NotChecked=0, Total=8930 [2022-03-15 18:51:04,072 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 762 mSDsluCounter, 1339 mSDsCounter, 0 mSdLazyCounter, 5777 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 5777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-03-15 18:51:04,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [762 Valid, 0 Invalid, 5862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 5777 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-03-15 18:51:04,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4766 states. [2022-03-15 18:51:04,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4766 to 1488. [2022-03-15 18:51:04,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 1487 states have (on average 3.5756556825823806) internal successors, (5317), 1487 states have internal predecessors, (5317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:04,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 5317 transitions. [2022-03-15 18:51:04,137 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 5317 transitions. Word has length 31 [2022-03-15 18:51:04,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:51:04,137 INFO L470 AbstractCegarLoop]: Abstraction has 1488 states and 5317 transitions. [2022-03-15 18:51:04,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:51:04,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 5317 transitions. [2022-03-15 18:51:04,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 18:51:04,141 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:51:04,141 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:51:04,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 18:51:04,363 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,SelfDestructingSolverStorable17 [2022-03-15 18:51:04,364 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:51:04,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:51:04,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1545468447, now seen corresponding path program 4 times [2022-03-15 18:51:04,365 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:51:04,365 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450997044] [2022-03-15 18:51:04,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:51:04,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:51:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:51:05,074 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 18:51:05,074 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:51:05,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450997044] [2022-03-15 18:51:05,074 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450997044] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:51:05,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439957671] [2022-03-15 18:51:05,074 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 18:51:05,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:51:05,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:51:05,076 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 18:51:05,082 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 18:51:05,190 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 18:51:05,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:51:05,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 18:51:05,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:51:05,375 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 18:51:05,428 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 18:51:05,484 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 18:51:05,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 18:51:05,682 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 18:51:06,394 INFO L353 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2022-03-15 18:51:06,394 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 77 treesize of output 65 [2022-03-15 18:51:06,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 18:51:06,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:51:10,254 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_787 (Array Int Int)) (~get2~0.offset Int) (~get2~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_787))) (let ((.cse2 (select .cse1 ~get2~0.base)) (.cse0 (select (select .cse1 c_~get3~0.base) c_~get3~0.offset))) (or (and (< 0 c_~n1~0) (<= .cse0 (select (select .cse1 c_~get1~0.base) c_~get1~0.offset))) (< |c_thread1Thread1of1ForFork1_#t~mem4| (select .cse2 (+ (* c_thread1Thread1of1ForFork1_~i~0 4) ~get2~0.offset))) (< (select .cse2 ~get2~0.offset) .cse0))))) is different from false [2022-03-15 18:51:10,316 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_787 (Array Int Int)) (~get2~0.offset Int) (~get2~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_787))) (let ((.cse3 (select .cse1 ~get2~0.base)) (.cse0 (select (select .cse1 c_~get3~0.base) c_~get3~0.offset))) (or (and (< 0 c_~n1~0) (<= .cse0 (select (select .cse1 c_~get1~0.base) c_~get1~0.offset))) (let ((.cse2 (* c_thread1Thread1of1ForFork1_~i~0 4))) (< (select (select |c_#memory_int| c_~get1~0.base) (+ .cse2 c_~get1~0.offset)) (select .cse3 (+ .cse2 ~get2~0.offset)))) (< (select .cse3 ~get2~0.offset) .cse0))))) is different from false [2022-03-15 18:51:10,393 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_787 (Array Int Int)) (~get2~0.offset Int) (~get2~0.base Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_787))) (let ((.cse1 (select .cse3 ~get2~0.base)) (.cse2 (select (select .cse3 c_~get3~0.base) c_~get3~0.offset))) (or (let ((.cse0 (* c_thread1Thread1of1ForFork1_~i~0 4))) (< (select (select |c_#memory_int| c_~get1~0.base) (+ .cse0 c_~get1~0.offset)) (select .cse1 (+ .cse0 ~get2~0.offset)))) (< (select .cse1 ~get2~0.offset) .cse2) (and (<= 0 c_thread1Thread1of1ForFork1_~i~0) (<= .cse2 (select (select .cse3 c_~get1~0.base) c_~get1~0.offset))))))) is different from false [2022-03-15 18:51:10,612 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:51:10,613 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 157 treesize of output 97 [2022-03-15 18:51:10,645 INFO L353 Elim1Store]: treesize reduction 23, result has 32.4 percent of original size [2022-03-15 18:51:10,645 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 15680 treesize of output 14731 [2022-03-15 18:51:10,741 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:51:10,742 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 14720 treesize of output 13080 [2022-03-15 18:51:10,865 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:51:10,866 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 13056 treesize of output 12120 [2022-03-15 18:51:11,016 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 18:51:11,017 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 12096 treesize of output 11640 Received shutdown request... [2022-03-15 19:02:24,202 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-03-15 19:02:24,204 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-03-15 19:02:24,208 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:02:24,221 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:02:24,241 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:02:24,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:24,405 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 11ms.. [2022-03-15 19:02:24,406 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 19:02:24,406 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 19:02:24,406 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 19:02:24,408 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:02:24,409 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 19:02:24,409 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 19:02:24,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 07:02:24 BasicIcfg [2022-03-15 19:02:24,411 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 19:02:24,412 INFO L158 Benchmark]: Toolchain (without parser) took 781572.51ms. Allocated memory was 201.3MB in the beginning and 739.2MB in the end (delta: 537.9MB). Free memory was 146.7MB in the beginning and 346.0MB in the end (delta: -199.4MB). Peak memory consumption was 465.7MB. Max. memory is 8.0GB. [2022-03-15 19:02:24,412 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 201.3MB. Free memory is still 163.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 19:02:24,412 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.10ms. Allocated memory is still 201.3MB. Free memory was 146.5MB in the beginning and 174.0MB in the end (delta: -27.5MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. [2022-03-15 19:02:24,412 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.98ms. Allocated memory is still 201.3MB. Free memory was 174.0MB in the beginning and 171.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:02:24,413 INFO L158 Benchmark]: Boogie Preprocessor took 27.98ms. Allocated memory is still 201.3MB. Free memory was 171.9MB in the beginning and 169.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:02:24,413 INFO L158 Benchmark]: RCFGBuilder took 556.20ms. Allocated memory is still 201.3MB. Free memory was 169.8MB in the beginning and 148.3MB in the end (delta: 21.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-03-15 19:02:24,413 INFO L158 Benchmark]: TraceAbstraction took 780677.30ms. Allocated memory was 201.3MB in the beginning and 739.2MB in the end (delta: 537.9MB). Free memory was 147.7MB in the beginning and 346.0MB in the end (delta: -198.3MB). Peak memory consumption was 467.7MB. Max. memory is 8.0GB. [2022-03-15 19:02:24,414 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 201.3MB. Free memory is still 163.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 259.10ms. Allocated memory is still 201.3MB. Free memory was 146.5MB in the beginning and 174.0MB in the end (delta: -27.5MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.98ms. Allocated memory is still 201.3MB. Free memory was 174.0MB in the beginning and 171.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.98ms. Allocated memory is still 201.3MB. Free memory was 171.9MB in the beginning and 169.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 556.20ms. Allocated memory is still 201.3MB. Free memory was 169.8MB in the beginning and 148.3MB in the end (delta: 21.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 780677.30ms. Allocated memory was 201.3MB in the beginning and 739.2MB in the end (delta: 537.9MB). Free memory was 147.7MB in the beginning and 346.0MB in the end (delta: -198.3MB). Peak memory consumption was 467.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.6s, 308 PlacesBefore, 42 PlacesAfterwards, 332 TransitionsBefore, 43 TransitionsAfterwards, 12480 CoEnabledTransitionPairs, 8 FixpointIterations, 168 TrivialSequentialCompositions, 98 ConcurrentSequentialCompositions, 32 TrivialYvCompositions, 36 ConcurrentYvCompositions, 23 ChoiceCompositions, 357 TotalNumberOfCompositions, 15018 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12233, positive: 12054, positive conditional: 0, positive unconditional: 12054, negative: 179, negative conditional: 0, negative unconditional: 179, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7082, positive: 7041, positive conditional: 0, positive unconditional: 7041, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 12233, positive: 5013, positive conditional: 0, positive unconditional: 5013, negative: 138, negative conditional: 0, negative unconditional: 138, unknown: 7082, unknown conditional: 0, unknown unconditional: 7082] , Statistics on independence cache: Total cache size (in pairs): 162, Positive cache size: 151, Positive conditional cache size: 0, Positive unconditional cache size: 151, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - 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: 128]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 11ms.. - 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 32 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 11ms.. - TimeoutResultAtElement [Line: 120]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 11ms.. - TimeoutResultAtElement [Line: 122]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 11ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 404 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 780.4s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 21.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.7s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6022 SdHoareTripleChecker+Valid, 9.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6022 mSDsluCounter, 190 SdHoareTripleChecker+Invalid, 7.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5998 mSDsCounter, 668 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15828 IncrementalHoareTripleChecker+Invalid, 16496 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 668 mSolverCounterUnsat, 41 mSDtfsCounter, 15828 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1989 GetRequests, 1375 SyntacticMatches, 91 SemanticMatches, 523 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7904 ImplicationChecksByTransitivity, 20.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1488occurred in iteration=18, InterpolantAutomatonStates: 317, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 11758 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 24.3s InterpolantComputationTime, 656 NumberOfCodeBlocks, 656 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 842 ConstructedInterpolants, 25 QuantifiedInterpolants, 9173 SizeOfPredicates, 155 NumberOfNonLiveVariables, 2453 ConjunctsInSsa, 177 ConjunctsInUnsatCore, 34 InterpolantComputations, 14 PerfectInterpolantSequences, 50/85 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